./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:09:33,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:09:33,215 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:09:33,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:09:33,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:09:33,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:09:33,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:09:33,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:09:33,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:09:33,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:09:33,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:09:33,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:09:33,249 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:09:33,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:09:33,250 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:09:33,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:09:33,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:09:33,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:09:33,253 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:09:33,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:09:33,254 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:09:33,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:09:33,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:09:33,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:09:33,257 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:09:33,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:09:33,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:09:33,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:09:33,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:09:33,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:09:33,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:09:33,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:09:33,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:09:33,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:09:33,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:09:33,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:09:33,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:09:33,265 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:09:33,265 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_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/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_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2023-11-12 02:09:33,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:09:33,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:09:33,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:09:33,548 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:09:33,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:09:33,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-12 02:09:36,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:09:37,115 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:09:37,116 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-12 02:09:37,141 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/data/174fb539a/0db0d47982534ddc900f21c0ae222a30/FLAG6d4c7cd9b [2023-11-12 02:09:37,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/data/174fb539a/0db0d47982534ddc900f21c0ae222a30 [2023-11-12 02:09:37,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:09:37,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:09:37,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:09:37,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:09:37,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:09:37,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb9f2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37, skipping insertion in model container [2023-11-12 02:09:37,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,227 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:09:37,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:09:37,664 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:09:37,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:09:37,781 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:09:37,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37 WrapperNode [2023-11-12 02:09:37,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:09:37,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:09:37,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:09:37,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:09:37,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,843 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-11-12 02:09:37,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:09:37,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:09:37,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:09:37,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:09:37,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:09:37,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:09:37,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:09:37,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:09:37,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (1/1) ... [2023-11-12 02:09:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:09:37,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:37,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:37,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:09:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:09:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 02:09:37,981 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 02:09:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:09:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:09:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:09:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:09:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:09:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:09:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:09:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:09:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:09:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:09:38,138 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:09:38,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:09:38,564 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:09:38,572 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:09:38,572 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:09:38,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:09:38 BoogieIcfgContainer [2023-11-12 02:09:38,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:09:38,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:09:38,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:09:38,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:09:38,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:09:37" (1/3) ... [2023-11-12 02:09:38,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d22ad84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:09:38, skipping insertion in model container [2023-11-12 02:09:38,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:37" (2/3) ... [2023-11-12 02:09:38,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d22ad84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:09:38, skipping insertion in model container [2023-11-12 02:09:38,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:09:38" (3/3) ... [2023-11-12 02:09:38,585 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-11-12 02:09:38,605 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:09:38,606 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-12 02:09:38,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:09:38,663 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;@5b94b02c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:09:38,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-12 02:09:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 53 states have (on average 2.0) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 02:09:38,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:38,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:09:38,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:38,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 893948658, now seen corresponding path program 1 times [2023-11-12 02:09:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472387311] [2023-11-12 02:09:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:38,995 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-12 02:09:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472387311] [2023-11-12 02:09:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472387311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:09:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33086712] [2023-11-12 02:09:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:39,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:09:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:09:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:09:39,035 INFO L87 Difference]: Start difference. First operand has 101 states, 53 states have (on average 2.0) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-12 02:09:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:39,156 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2023-11-12 02:09:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:09:39,159 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-12 02:09:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:39,167 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:09:39,167 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 02:09:39,169 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-12 02:09:39,173 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:39,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 02:09:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 02:09:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 50 states have (on average 1.88) internal successors, (94), 90 states have internal predecessors, (94), 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-12 02:09:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2023-11-12 02:09:39,217 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 6 [2023-11-12 02:09:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:39,218 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-11-12 02:09:39,218 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-12 02:09:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2023-11-12 02:09:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 02:09:39,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:39,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:09:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:09:39,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:39,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 893948659, now seen corresponding path program 1 times [2023-11-12 02:09:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766235425] [2023-11-12 02:09:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:39,435 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-12 02:09:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766235425] [2023-11-12 02:09:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766235425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:39,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:39,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:09:39,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865806444] [2023-11-12 02:09:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:39,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:09:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:09:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:09:39,439 INFO L87 Difference]: Start difference. First operand 94 states and 98 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-12 02:09:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:39,538 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2023-11-12 02:09:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:09:39,539 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-12 02:09:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:39,540 INFO L225 Difference]: With dead ends: 91 [2023-11-12 02:09:39,540 INFO L226 Difference]: Without dead ends: 91 [2023-11-12 02:09:39,541 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-12 02:09:39,543 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:39,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-12 02:09:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-12 02:09:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2023-11-12 02:09:39,554 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 6 [2023-11-12 02:09:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:39,555 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2023-11-12 02:09:39,555 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-12 02:09:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2023-11-12 02:09:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 02:09:39,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:39,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:39,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:09:39,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:39,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 80530360, now seen corresponding path program 1 times [2023-11-12 02:09:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345779971] [2023-11-12 02:09:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:39,745 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-12 02:09:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345779971] [2023-11-12 02:09:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345779971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:09:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421563371] [2023-11-12 02:09:39,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:39,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:09:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:39,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:09:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:09:39,752 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 02:09:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:39,892 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-11-12 02:09:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:09:39,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-11-12 02:09:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:39,894 INFO L225 Difference]: With dead ends: 102 [2023-11-12 02:09:39,894 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 02:09:39,894 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-12 02:09:39,896 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:39,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 212 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 02:09:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2023-11-12 02:09:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.803921568627451) internal successors, (92), 88 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-12 02:09:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2023-11-12 02:09:39,908 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 14 [2023-11-12 02:09:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:39,908 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2023-11-12 02:09:39,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 02:09:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2023-11-12 02:09:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 02:09:39,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:39,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:39,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:09:39,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:39,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:39,911 INFO L85 PathProgramCache]: Analyzing trace with hash 193725728, now seen corresponding path program 1 times [2023-11-12 02:09:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814791822] [2023-11-12 02:09:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,182 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-12 02:09:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814791822] [2023-11-12 02:09:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814791822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:40,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:09:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283820812] [2023-11-12 02:09:40,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:40,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:09:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:09:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:09:40,186 INFO L87 Difference]: Start difference. First operand 92 states and 96 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-12 02:09:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:40,445 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2023-11-12 02:09:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:09:40,445 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 24 [2023-11-12 02:09:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:40,449 INFO L225 Difference]: With dead ends: 91 [2023-11-12 02:09:40,449 INFO L226 Difference]: Without dead ends: 91 [2023-11-12 02:09:40,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:09:40,459 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:40,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 288 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-12 02:09:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-12 02:09:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2023-11-12 02:09:40,467 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 24 [2023-11-12 02:09:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:40,468 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2023-11-12 02:09:40,468 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-12 02:09:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2023-11-12 02:09:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 02:09:40,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:40,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:40,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:09:40,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:40,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 193725729, now seen corresponding path program 1 times [2023-11-12 02:09:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:40,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493483679] [2023-11-12 02:09:40,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:40,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:40,931 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-12 02:09:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493483679] [2023-11-12 02:09:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493483679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:40,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:09:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872206633] [2023-11-12 02:09:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:09:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:09:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:09:40,936 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 02:09:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:41,170 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2023-11-12 02:09:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:09:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2023-11-12 02:09:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:41,172 INFO L225 Difference]: With dead ends: 90 [2023-11-12 02:09:41,172 INFO L226 Difference]: Without dead ends: 90 [2023-11-12 02:09:41,172 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-12 02:09:41,173 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:41,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 312 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-12 02:09:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-12 02:09:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-11-12 02:09:41,181 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 24 [2023-11-12 02:09:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:41,182 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-11-12 02:09:41,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 02:09:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-11-12 02:09:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:09:41,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:41,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:41,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:09:41,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:41,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1486830593, now seen corresponding path program 1 times [2023-11-12 02:09:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515402599] [2023-11-12 02:09:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515402599] [2023-11-12 02:09:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515402599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303075313] [2023-11-12 02:09:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:41,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:41,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:41,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:09:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:41,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-12 02:09:41,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:41,883 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-12 02:09:41,959 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 02:09:42,068 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 02:09:42,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 02:09:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-12 02:09:42,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303075313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:42,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:09:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-12 02:09:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882948960] [2023-11-12 02:09:42,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:42,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:09:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:09:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-12 02:09:42,200 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:42,549 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-11-12 02:09:42,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:09:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-12 02:09:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:42,551 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:09:42,552 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:09:42,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-12 02:09:42,553 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 8 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:42,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 283 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2023-11-12 02:09:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:09:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-12 02:09:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 90 states have internal predecessors, (96), 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-12 02:09:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2023-11-12 02:09:42,570 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 26 [2023-11-12 02:09:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:42,570 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2023-11-12 02:09:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2023-11-12 02:09:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:09:42,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:42,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:42,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:09:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:42,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:42,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1486830594, now seen corresponding path program 1 times [2023-11-12 02:09:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328401939] [2023-11-12 02:09:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:43,488 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-12 02:09:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328401939] [2023-11-12 02:09:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328401939] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451171049] [2023-11-12 02:09:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:43,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:43,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:09:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:43,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 02:09:43,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:43,652 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-12 02:09:43,765 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 02:09:43,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:43,834 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-12 02:09:43,843 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:09:43,843 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-12 02:09:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-12 02:09:43,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451171049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:44,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:09:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2023-11-12 02:09:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184840224] [2023-11-12 02:09:44,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:44,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:09:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:09:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-11-12 02:09:44,035 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:44,422 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-11-12 02:09:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:09:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-12 02:09:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:44,424 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:09:44,424 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:09:44,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-11-12 02:09:44,426 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:44,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 363 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2023-11-12 02:09:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:09:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-12 02:09:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 90 states have internal predecessors, (95), 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-12 02:09:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-11-12 02:09:44,462 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 26 [2023-11-12 02:09:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:44,463 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-11-12 02:09:44,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-11-12 02:09:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 02:09:44,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:44,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:44,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:44,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:44,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:44,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1379755561, now seen corresponding path program 1 times [2023-11-12 02:09:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:44,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025980600] [2023-11-12 02:09:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025980600] [2023-11-12 02:09:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025980600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678044862] [2023-11-12 02:09:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:44,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:44,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:44,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:09:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:44,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:09:44,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:45,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678044862] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:45,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-12 02:09:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332698921] [2023-11-12 02:09:45,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:09:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:09:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:09:45,067 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:45,213 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-11-12 02:09:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:09:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-12 02:09:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:45,215 INFO L225 Difference]: With dead ends: 96 [2023-11-12 02:09:45,215 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 02:09:45,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:09:45,217 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:45,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 430 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 02:09:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2023-11-12 02:09:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.709090909090909) internal successors, (94), 90 states have internal predecessors, (94), 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-12 02:09:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2023-11-12 02:09:45,223 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 28 [2023-11-12 02:09:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:45,223 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2023-11-12 02:09:45,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:09:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2023-11-12 02:09:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 02:09:45,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:45,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:45,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:45,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:45,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:45,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 172469906, now seen corresponding path program 1 times [2023-11-12 02:09:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937294367] [2023-11-12 02:09:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:45,571 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-12 02:09:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937294367] [2023-11-12 02:09:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937294367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999664834] [2023-11-12 02:09:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:45,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:45,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:45,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:09:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:45,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:09:45,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:45,753 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-12 02:09:45,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:45,767 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:09:45,767 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 12 treesize of output 11 [2023-11-12 02:09:45,788 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-12 02:09:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999664834] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:45,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-12 02:09:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022394026] [2023-11-12 02:09:45,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:45,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:09:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:09:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:09:45,791 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:45,971 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2023-11-12 02:09:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:09:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-12 02:09:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:45,974 INFO L225 Difference]: With dead ends: 100 [2023-11-12 02:09:45,974 INFO L226 Difference]: Without dead ends: 100 [2023-11-12 02:09:45,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:09:45,975 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:45,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 209 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-12 02:09:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-11-12 02:09:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.706896551724138) internal successors, (99), 93 states have internal predecessors, (99), 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-12 02:09:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-11-12 02:09:45,981 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 29 [2023-11-12 02:09:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:45,981 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-11-12 02:09:45,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 02:09:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-11-12 02:09:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 02:09:45,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:45,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:45,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:46,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:46,189 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:46,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 172469907, now seen corresponding path program 1 times [2023-11-12 02:09:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719175615] [2023-11-12 02:09:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719175615] [2023-11-12 02:09:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719175615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907696308] [2023-11-12 02:09:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:46,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:46,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:46,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:09:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:46,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 02:09:46,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:46,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:46,862 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:09:46,863 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 23 [2023-11-12 02:09:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907696308] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:47,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-12 02:09:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586880671] [2023-11-12 02:09:47,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:47,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 02:09:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 02:09:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:09:47,032 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-12 02:09:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:47,296 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2023-11-12 02:09:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:09:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-11-12 02:09:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:47,298 INFO L225 Difference]: With dead ends: 104 [2023-11-12 02:09:47,298 INFO L226 Difference]: Without dead ends: 104 [2023-11-12 02:09:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:09:47,299 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 24 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:47,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 761 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-12 02:09:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-12 02:09:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 93 states have internal predecessors, (98), 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-12 02:09:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-11-12 02:09:47,307 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 29 [2023-11-12 02:09:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:47,307 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-11-12 02:09:47,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-12 02:09:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-11-12 02:09:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 02:09:47,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:47,313 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:09:47,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:47,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 02:09:47,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:47,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1051599795, now seen corresponding path program 1 times [2023-11-12 02:09:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404346669] [2023-11-12 02:09:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:09:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404346669] [2023-11-12 02:09:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404346669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:09:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230561432] [2023-11-12 02:09:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:47,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:09:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:09:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:09:47,709 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-12 02:09:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:47,959 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-11-12 02:09:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:09:47,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-12 02:09:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:47,961 INFO L225 Difference]: With dead ends: 98 [2023-11-12 02:09:47,961 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 02:09:47,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:09:47,962 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:47,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 02:09:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-11-12 02:09:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 92 states have internal predecessors, (97), 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-12 02:09:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-11-12 02:09:47,967 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 30 [2023-11-12 02:09:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:47,968 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-11-12 02:09:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-12 02:09:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-11-12 02:09:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 02:09:47,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:47,969 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:09:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:09:47,970 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:47,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1051599796, now seen corresponding path program 1 times [2023-11-12 02:09:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223963060] [2023-11-12 02:09:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223963060] [2023-11-12 02:09:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223963060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:09:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57999359] [2023-11-12 02:09:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:48,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:09:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:09:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:09:48,297 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-12 02:09:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:48,541 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-11-12 02:09:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:09:48,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-12 02:09:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:48,543 INFO L225 Difference]: With dead ends: 96 [2023-11-12 02:09:48,543 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 02:09:48,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:09:48,544 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:48,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 348 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:09:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 02:09:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-12 02:09:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 91 states have internal predecessors, (96), 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-12 02:09:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-11-12 02:09:48,548 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 30 [2023-11-12 02:09:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:48,549 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-11-12 02:09:48,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-12 02:09:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-11-12 02:09:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 02:09:48,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:48,550 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:09:48,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:09:48,550 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:48,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 784522486, now seen corresponding path program 1 times [2023-11-12 02:09:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826210470] [2023-11-12 02:09:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:09:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826210470] [2023-11-12 02:09:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826210470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288294968] [2023-11-12 02:09:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:49,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:49,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:49,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 02:09:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:49,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:09:49,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:49,220 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-12 02:09:49,281 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from false [2023-11-12 02:09:49,284 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from true [2023-11-12 02:09:49,303 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from false [2023-11-12 02:09:49,306 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from true [2023-11-12 02:09:49,339 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 02:09:49,390 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 02:09:49,390 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 12 treesize of output 14 [2023-11-12 02:09:49,400 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))) is different from false [2023-11-12 02:09:49,403 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))) is different from true [2023-11-12 02:09:49,546 WARN L854 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))))))) is different from false [2023-11-12 02:09:49,549 WARN L876 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))))))) is different from true [2023-11-12 02:09:49,771 WARN L854 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))))))) is different from false [2023-11-12 02:09:49,774 WARN L876 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))))))) is different from true [2023-11-12 02:09:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2023-11-12 02:09:49,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288294968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:49,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:09:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2023-11-12 02:09:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749392749] [2023-11-12 02:09:49,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:49,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 02:09:49,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 02:09:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=144, Unknown=11, NotChecked=174, Total=380 [2023-11-12 02:09:49,882 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 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-12 02:09:49,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from false [2023-11-12 02:09:49,998 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from true [2023-11-12 02:09:50,002 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse0))) is different from false [2023-11-12 02:09:50,006 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse0))) is different from true [2023-11-12 02:09:50,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))))) (and .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))))) is different from false [2023-11-12 02:09:50,015 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))))) (and .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1)))))) is different from true [2023-11-12 02:09:50,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-12 02:09:50,023 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-12 02:09:50,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))))) is different from false [2023-11-12 02:09:50,030 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))))) is different from true [2023-11-12 02:09:50,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))) .cse0)) is different from false [2023-11-12 02:09:50,041 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (= (select |c_#valid| |node_create_~temp~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))))))) .cse0)) is different from true [2023-11-12 02:09:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:50,404 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2023-11-12 02:09:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 02:09:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 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 34 [2023-11-12 02:09:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:50,405 INFO L225 Difference]: With dead ends: 135 [2023-11-12 02:09:50,406 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 02:09:50,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=214, Unknown=23, NotChecked=492, Total=812 [2023-11-12 02:09:50,407 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 140 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1040 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:50,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 381 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 445 Invalid, 0 Unknown, 1040 Unchecked, 0.4s Time] [2023-11-12 02:09:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 02:09:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2023-11-12 02:09:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 100 states have internal predecessors, (113), 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-12 02:09:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-11-12 02:09:50,412 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 34 [2023-11-12 02:09:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:50,412 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-11-12 02:09:50,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 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-12 02:09:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-11-12 02:09:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 02:09:50,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:50,415 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:09:50,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 02:09:50,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:50,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 784522487, now seen corresponding path program 1 times [2023-11-12 02:09:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904104809] [2023-11-12 02:09:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:51,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904104809] [2023-11-12 02:09:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904104809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253148427] [2023-11-12 02:09:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:51,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:51,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:51,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 02:09:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:52,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-12 02:09:52,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:52,091 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-12 02:09:52,121 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-12 02:09:52,148 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-12 02:09:52,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:52,193 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-12 02:09:52,215 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-12 02:09:52,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:52,263 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-12 02:09:52,306 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-12 02:09:52,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253148427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:52,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:09:52,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6] total 22 [2023-11-12 02:09:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555862362] [2023-11-12 02:09:52,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:52,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 02:09:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:52,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 02:09:52,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=493, Unknown=1, NotChecked=46, Total=650 [2023-11-12 02:09:52,519 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (4), 2 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-12 02:09:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:53,114 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-11-12 02:09:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:09:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (4), 2 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 34 [2023-11-12 02:09:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:53,116 INFO L225 Difference]: With dead ends: 98 [2023-11-12 02:09:53,117 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 02:09:53,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=750, Unknown=1, NotChecked=58, Total=992 [2023-11-12 02:09:53,118 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 287 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:53,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 252 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 394 Invalid, 0 Unknown, 83 Unchecked, 0.4s Time] [2023-11-12 02:09:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 02:09:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 02:09:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 93 states have internal predecessors, (102), 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-12 02:09:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2023-11-12 02:09:53,124 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 34 [2023-11-12 02:09:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:53,125 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2023-11-12 02:09:53,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (4), 2 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-12 02:09:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2023-11-12 02:09:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 02:09:53,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:53,126 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:09:53,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 02:09:53,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:53,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash 784522482, now seen corresponding path program 1 times [2023-11-12 02:09:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052446607] [2023-11-12 02:09:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:09:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052446607] [2023-11-12 02:09:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052446607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:53,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:53,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:09:53,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369663951] [2023-11-12 02:09:53,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:53,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:09:53,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:09:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:09:53,470 INFO L87 Difference]: Start difference. First operand 98 states and 108 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-12 02:09:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:53,560 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2023-11-12 02:09:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:09:53,561 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 34 [2023-11-12 02:09:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:53,562 INFO L225 Difference]: With dead ends: 135 [2023-11-12 02:09:53,562 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 02:09:53,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:09:53,563 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 139 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:53,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 183 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 02:09:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2023-11-12 02:09:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 92 states have internal predecessors, (99), 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-12 02:09:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-12 02:09:53,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 34 [2023-11-12 02:09:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:53,569 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-12 02:09:53,569 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-12 02:09:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-12 02:09:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 02:09:53,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:53,570 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:09:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:09:53,570 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:53,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1449606688, now seen corresponding path program 1 times [2023-11-12 02:09:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188611250] [2023-11-12 02:09:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:09:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188611250] [2023-11-12 02:09:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188611250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:53,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:09:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048581716] [2023-11-12 02:09:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:53,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:09:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:09:53,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:09:53,904 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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-12 02:09:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:54,331 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-11-12 02:09:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:09:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-12 02:09:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:54,333 INFO L225 Difference]: With dead ends: 120 [2023-11-12 02:09:54,334 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 02:09:54,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:09:54,335 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:54,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 388 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:09:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 02:09:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2023-11-12 02:09:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 93 states have internal predecessors, (100), 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-12 02:09:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-12 02:09:54,340 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 35 [2023-11-12 02:09:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:54,340 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-12 02:09:54,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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-12 02:09:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-12 02:09:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 02:09:54,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:54,342 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:09:54,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:09:54,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:54,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1449606687, now seen corresponding path program 1 times [2023-11-12 02:09:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072102709] [2023-11-12 02:09:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072102709] [2023-11-12 02:09:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072102709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:09:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046844615] [2023-11-12 02:09:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:54,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:09:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:09:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:09:54,829 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:09:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:55,352 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-11-12 02:09:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:09:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-12 02:09:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:55,353 INFO L225 Difference]: With dead ends: 125 [2023-11-12 02:09:55,354 INFO L226 Difference]: Without dead ends: 125 [2023-11-12 02:09:55,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:09:55,355 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 153 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:55,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 424 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:09:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-12 02:09:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2023-11-12 02:09:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 93 states have internal predecessors, (98), 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-12 02:09:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-11-12 02:09:55,360 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 35 [2023-11-12 02:09:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:55,360 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-11-12 02:09:55,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:09:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-11-12 02:09:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 02:09:55,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:55,362 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:09:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:09:55,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:55,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1502622463, now seen corresponding path program 1 times [2023-11-12 02:09:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122103528] [2023-11-12 02:09:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:09:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122103528] [2023-11-12 02:09:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122103528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:09:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203386627] [2023-11-12 02:09:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:09:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:09:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:09:55,454 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:09:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:55,549 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-11-12 02:09:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:09:55,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-11-12 02:09:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:55,550 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:09:55,551 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:09:55,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12 02:09:55,552 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:55,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 124 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:09:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:09:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2023-11-12 02:09:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.459016393442623) internal successors, (89), 84 states have internal predecessors, (89), 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-12 02:09:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-11-12 02:09:55,556 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 37 [2023-11-12 02:09:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:55,557 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-11-12 02:09:55,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:09:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-11-12 02:09:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 02:09:55,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:55,558 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:09:55,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:09:55,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:55,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash -911174046, now seen corresponding path program 1 times [2023-11-12 02:09:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:55,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35114483] [2023-11-12 02:09:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35114483] [2023-11-12 02:09:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35114483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-12 02:09:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548632166] [2023-11-12 02:09:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:56,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 02:09:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 02:09:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:09:56,334 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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-12 02:09:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:57,047 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2023-11-12 02:09:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 02:09:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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 39 [2023-11-12 02:09:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:57,048 INFO L225 Difference]: With dead ends: 106 [2023-11-12 02:09:57,049 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 02:09:57,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2023-11-12 02:09:57,050 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 98 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:57,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 548 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:09:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 02:09:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2023-11-12 02:09:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 87 states have internal predecessors, (94), 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-12 02:09:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-11-12 02:09:57,054 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 39 [2023-11-12 02:09:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:57,055 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-11-12 02:09:57,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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-12 02:09:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-11-12 02:09:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 02:09:57,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:57,056 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:09:57,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:09:57,057 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:09:57,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -911174045, now seen corresponding path program 1 times [2023-11-12 02:09:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604199792] [2023-11-12 02:09:57,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:09:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,153 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-12 02:09:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604199792] [2023-11-12 02:09:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604199792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213146851] [2023-11-12 02:09:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:58,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:58,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 02:09:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-12 02:09:58,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:58,771 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 11 treesize of output 7 [2023-11-12 02:09:58,778 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 15 treesize of output 1 [2023-11-12 02:09:59,071 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:09:59,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2023-11-12 02:09:59,215 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-12 02:09:59,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:59,794 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 130 treesize of output 122 [2023-11-12 02:09:59,921 INFO L322 Elim1Store]: treesize reduction 57, result has 48.6 percent of original size [2023-11-12 02:09:59,922 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 323 [2023-11-12 02:10:00,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:10:00,211 INFO L322 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2023-11-12 02:10:00,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 321 [2023-11-12 02:10:00,368 INFO L322 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2023-11-12 02:10:00,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 6 new quantified variables, introduced 10 case distinctions, treesize of input 696 treesize of output 671 [2023-11-12 02:10:01,029 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:10:01,030 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 15 treesize of output 19 [2023-11-12 02:10:01,303 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-12 02:10:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213146851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:01,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 14] total 44 [2023-11-12 02:10:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775388254] [2023-11-12 02:10:01,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:01,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-12 02:10:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-12 02:10:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2023-11-12 02:10:01,307 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 02:10:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:03,090 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2023-11-12 02:10:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-12 02:10:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2023-11-12 02:10:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:03,092 INFO L225 Difference]: With dead ends: 166 [2023-11-12 02:10:03,092 INFO L226 Difference]: Without dead ends: 166 [2023-11-12 02:10:03,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=328, Invalid=3094, Unknown=0, NotChecked=0, Total=3422 [2023-11-12 02:10:03,094 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 379 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:03,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 886 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 02:10:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-12 02:10:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2023-11-12 02:10:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 99 states have internal predecessors, (107), 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-12 02:10:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2023-11-12 02:10:03,124 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 39 [2023-11-12 02:10:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:03,124 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2023-11-12 02:10:03,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 02:10:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2023-11-12 02:10:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-12 02:10:03,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:03,126 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:03,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:03,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:03,332 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:03,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1818361792, now seen corresponding path program 1 times [2023-11-12 02:10:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710680041] [2023-11-12 02:10:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710680041] [2023-11-12 02:10:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710680041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:03,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:10:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147050122] [2023-11-12 02:10:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:10:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:03,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:10:03,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:10:03,603 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-12 02:10:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:03,969 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-11-12 02:10:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:10:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2023-11-12 02:10:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:03,971 INFO L225 Difference]: With dead ends: 145 [2023-11-12 02:10:03,971 INFO L226 Difference]: Without dead ends: 145 [2023-11-12 02:10:03,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:10:03,972 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 179 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:03,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 481 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:10:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-12 02:10:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2023-11-12 02:10:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 112 states have internal predecessors, (128), 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-12 02:10:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2023-11-12 02:10:03,977 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 40 [2023-11-12 02:10:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:03,977 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2023-11-12 02:10:03,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-12 02:10:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2023-11-12 02:10:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-12 02:10:03,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:03,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:03,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 02:10:03,978 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:03,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1100306469, now seen corresponding path program 1 times [2023-11-12 02:10:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055016124] [2023-11-12 02:10:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:10:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:10:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055016124] [2023-11-12 02:10:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055016124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341276360] [2023-11-12 02:10:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:04,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:04,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:04,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-12 02:10:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:10:04,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 02:10:04,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341276360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:10:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-12 02:10:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146364244] [2023-11-12 02:10:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:10:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:10:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:10:04,448 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 02:10:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:04,461 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2023-11-12 02:10:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:10:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2023-11-12 02:10:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:04,462 INFO L225 Difference]: With dead ends: 95 [2023-11-12 02:10:04,463 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 02:10:04,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-12 02:10:04,464 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:04,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:10:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 02:10:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-12 02:10:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 91 states have internal predecessors, (102), 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-12 02:10:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2023-11-12 02:10:04,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 41 [2023-11-12 02:10:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:04,468 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2023-11-12 02:10:04,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12 02:10:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2023-11-12 02:10:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-12 02:10:04,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:04,469 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:04,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:04,681 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:04,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash 534640802, now seen corresponding path program 1 times [2023-11-12 02:10:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901292105] [2023-11-12 02:10:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901292105] [2023-11-12 02:10:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901292105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:05,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:10:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97799813] [2023-11-12 02:10:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:10:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:10:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:10:05,014 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-12 02:10:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:05,372 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2023-11-12 02:10:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:10:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2023-11-12 02:10:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:05,374 INFO L225 Difference]: With dead ends: 110 [2023-11-12 02:10:05,374 INFO L226 Difference]: Without dead ends: 110 [2023-11-12 02:10:05,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:10:05,375 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 122 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:05,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 380 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:10:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-12 02:10:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2023-11-12 02:10:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.381578947368421) internal successors, (105), 94 states have internal predecessors, (105), 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-12 02:10:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2023-11-12 02:10:05,381 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 41 [2023-11-12 02:10:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:05,381 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2023-11-12 02:10:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-12 02:10:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2023-11-12 02:10:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-12 02:10:05,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:05,388 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:05,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-12 02:10:05,388 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:05,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash -592644945, now seen corresponding path program 1 times [2023-11-12 02:10:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000990670] [2023-11-12 02:10:05,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000990670] [2023-11-12 02:10:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000990670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718286302] [2023-11-12 02:10:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:06,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:06,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-12 02:10:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-12 02:10:06,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:06,720 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 19 treesize of output 1 [2023-11-12 02:10:06,881 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 27 treesize of output 19 [2023-11-12 02:10:06,969 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:10:06,969 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2023-11-12 02:10:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:10:06,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:07,157 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 18 [2023-11-12 02:10:07,363 INFO L322 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2023-11-12 02:10:07,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 146 [2023-11-12 02:10:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:10:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718286302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:07,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 31 [2023-11-12 02:10:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243086936] [2023-11-12 02:10:07,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:07,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-12 02:10:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-12 02:10:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2023-11-12 02:10:07,505 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 32 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-12 02:10:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:08,818 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-11-12 02:10:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-12 02:10:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2023-11-12 02:10:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:08,822 INFO L225 Difference]: With dead ends: 152 [2023-11-12 02:10:08,822 INFO L226 Difference]: Without dead ends: 152 [2023-11-12 02:10:08,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=234, Invalid=1928, Unknown=0, NotChecked=0, Total=2162 [2023-11-12 02:10:08,824 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 372 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:08,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 843 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:10:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-12 02:10:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 99. [2023-11-12 02:10:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 95 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:10:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-11-12 02:10:08,829 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 42 [2023-11-12 02:10:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:08,830 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-11-12 02:10:08,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-12 02:10:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-11-12 02:10:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-12 02:10:08,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:08,831 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:08,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:09,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:09,038 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:09,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash -606004222, now seen corresponding path program 1 times [2023-11-12 02:10:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493503226] [2023-11-12 02:10:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:09,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493503226] [2023-11-12 02:10:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493503226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:10:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175111300] [2023-11-12 02:10:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:09,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:10:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:10:09,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:10:09,157 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:10:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:09,288 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-11-12 02:10:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:10:09,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2023-11-12 02:10:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:09,290 INFO L225 Difference]: With dead ends: 98 [2023-11-12 02:10:09,290 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 02:10:09,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:10:09,291 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:09,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 193 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 02:10:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 02:10:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 94 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-12 02:10:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2023-11-12 02:10:09,294 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 42 [2023-11-12 02:10:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:09,295 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2023-11-12 02:10:09,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:10:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2023-11-12 02:10:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-12 02:10:09,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:09,295 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:09,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-12 02:10:09,296 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:09,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1606261595, now seen corresponding path program 1 times [2023-11-12 02:10:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459594886] [2023-11-12 02:10:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459594886] [2023-11-12 02:10:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459594886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042130668] [2023-11-12 02:10:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:09,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:09,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:09,666 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:09,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-12 02:10:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:10:09,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:10,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:10:10,127 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-12 02:10:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:10,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042130668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:10:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2023-11-12 02:10:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385454277] [2023-11-12 02:10:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:10,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:10:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:10,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:10:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:10:10,134 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-12 02:10:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:10,269 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-11-12 02:10:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:10:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 43 [2023-11-12 02:10:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:10,271 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:10:10,271 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:10:10,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:10:10,272 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:10,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 111 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:10:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 02:10:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 93 states have internal predecessors, (102), 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-12 02:10:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-11-12 02:10:10,277 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 43 [2023-11-12 02:10:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-11-12 02:10:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-12 02:10:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-11-12 02:10:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-12 02:10:10,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:10,278 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:10,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-12 02:10:10,485 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:10,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1698861906, now seen corresponding path program 1 times [2023-11-12 02:10:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651631049] [2023-11-12 02:10:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:10,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651631049] [2023-11-12 02:10:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651631049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:10,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:10:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292134716] [2023-11-12 02:10:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:10,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:10:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:10:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:10:10,681 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-12 02:10:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:10,848 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-11-12 02:10:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:10:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 44 [2023-11-12 02:10:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:10,849 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:10:10,849 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:10:10,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:10:10,850 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:10,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 149 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:10:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-12 02:10:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 92 states have internal predecessors, (101), 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-12 02:10:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-11-12 02:10:10,854 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 44 [2023-11-12 02:10:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:10,855 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-11-12 02:10:10,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-12 02:10:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-11-12 02:10:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-12 02:10:10,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:10,856 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:10,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-12 02:10:10,856 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:10,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1125111593, now seen corresponding path program 1 times [2023-11-12 02:10:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378986135] [2023-11-12 02:10:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:11,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378986135] [2023-11-12 02:10:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378986135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-12 02:10:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179727650] [2023-11-12 02:10:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:11,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 02:10:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 02:10:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:10:11,591 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 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-12 02:10:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:12,390 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-12 02:10:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-12 02:10:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 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 45 [2023-11-12 02:10:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:12,392 INFO L225 Difference]: With dead ends: 101 [2023-11-12 02:10:12,392 INFO L226 Difference]: Without dead ends: 101 [2023-11-12 02:10:12,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2023-11-12 02:10:12,393 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:12,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 426 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:10:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-12 02:10:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-11-12 02:10:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3125) internal successors, (105), 95 states have internal predecessors, (105), 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-12 02:10:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2023-11-12 02:10:12,398 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 45 [2023-11-12 02:10:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2023-11-12 02:10:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 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-12 02:10:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2023-11-12 02:10:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-12 02:10:12,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:12,400 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-12 02:10:12,401 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:12,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1125111594, now seen corresponding path program 1 times [2023-11-12 02:10:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:12,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008491170] [2023-11-12 02:10:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008491170] [2023-11-12 02:10:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008491170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:10:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775685937] [2023-11-12 02:10:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:13,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:10:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:10:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:10:13,004 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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-12 02:10:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:13,456 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2023-11-12 02:10:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 02:10:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 45 [2023-11-12 02:10:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:13,458 INFO L225 Difference]: With dead ends: 102 [2023-11-12 02:10:13,458 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 02:10:13,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:10:13,459 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:13,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 401 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:10:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 02:10:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-11-12 02:10:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 95 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-12 02:10:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2023-11-12 02:10:13,464 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 45 [2023-11-12 02:10:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:13,464 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2023-11-12 02:10:13,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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-12 02:10:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2023-11-12 02:10:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-12 02:10:13,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:13,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:13,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-12 02:10:13,466 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:13,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 967238856, now seen corresponding path program 1 times [2023-11-12 02:10:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777063425] [2023-11-12 02:10:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777063425] [2023-11-12 02:10:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777063425] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379743506] [2023-11-12 02:10:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:13,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:13,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:13,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-12 02:10:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:14,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:10:14,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:14,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:14,105 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:10:14,107 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 12 treesize of output 11 [2023-11-12 02:10:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:10:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379743506] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:14,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-11-12 02:10:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637182554] [2023-11-12 02:10:14,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:10:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:10:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:10:14,135 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 02:10:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:14,269 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-12 02:10:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:10:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 47 [2023-11-12 02:10:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:14,271 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:10:14,271 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 02:10:14,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:10:14,272 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 90 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:14,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 145 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 02:10:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 02:10:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.2625) internal successors, (101), 93 states have internal predecessors, (101), 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-12 02:10:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-12 02:10:14,278 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 47 [2023-11-12 02:10:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:14,278 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-12 02:10:14,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 02:10:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-12 02:10:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:10:14,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:14,279 INFO L195 NwaCegarLoop]: trace histogram [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-12 02:10:14,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:14,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:14,480 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 02:10:14,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash 274750680, now seen corresponding path program 1 times [2023-11-12 02:10:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:14,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365958219] [2023-11-12 02:10:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:10:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:10:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:10:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365958219] [2023-11-12 02:10:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365958219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50416134] [2023-11-12 02:10:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:15,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:15,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:15,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:15,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9ee8e6-0250-428a-ad41-e47caf7b0891/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-12 02:10:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:16,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-12 02:10:16,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:16,726 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 11 treesize of output 7 [2023-11-12 02:10:16,850 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 19 treesize of output 18 [2023-11-12 02:10:16,924 INFO L322 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-12 02:10:16,925 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-12 02:10:17,430 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 7 treesize of output 3 [2023-11-12 02:10:17,888 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-12 02:10:17,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 23 [2023-11-12 02:10:17,902 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-12 02:10:17,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:17,914 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:10:17,914 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 12 treesize of output 11 [2023-11-12 02:10:18,340 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-12 02:10:19,311 INFO L322 Elim1Store]: treesize reduction 48, result has 77.4 percent of original size [2023-11-12 02:10:19,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 57108 treesize of output 46251