./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:55:04,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:55:04,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:55:04,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:55:04,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:55:04,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:55:04,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:55:04,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:55:04,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:55:04,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:55:04,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:55:04,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:55:04,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:55:04,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:55:04,239 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:55:04,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:55:04,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:55:04,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:55:04,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:55:04,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:55:04,245 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:55:04,246 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:55:04,246 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:55:04,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:55:04,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:55:04,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:55:04,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:55:04,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:55:04,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:55:04,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:55:04,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:55:04,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:55:04,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:55:04,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:04,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:55:04,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:55:04,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:55:04,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:55:04,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:55:04,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:55:04,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:55:04,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:55:04,251 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2024-10-11 17:55:04,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:55:04,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:55:04,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:55:04,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:55:04,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:55:04,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-10-11 17:55:05,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:55:05,895 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:55:05,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-10-11 17:55:05,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/14fba7cf7/996af5048780424a991308ba471f19d8/FLAGa4709cc32 [2024-10-11 17:55:05,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/14fba7cf7/996af5048780424a991308ba471f19d8 [2024-10-11 17:55:05,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:55:05,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:55:05,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:05,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:55:05,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:55:05,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584b727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05, skipping insertion in model container [2024-10-11 17:55:05,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:55:06,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:06,200 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:55:06,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:06,262 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:55:06,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06 WrapperNode [2024-10-11 17:55:06,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:06,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:06,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:55:06,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:55:06,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,300 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-10-11 17:55:06,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:06,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:55:06,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:55:06,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:55:06,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,329 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-10-11 17:55:06,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:55:06,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:55:06,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:55:06,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:55:06,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (1/1) ... [2024-10-11 17:55:06,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:06,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:55:06,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:55:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:55:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:55:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:55:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:55:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:55:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:55:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:55:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:55:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:55:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:55:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:55:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:55:06,534 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:55:06,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:55:06,730 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 17:55:06,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:55:06,767 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:55:06,768 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:55:06,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:06 BoogieIcfgContainer [2024-10-11 17:55:06,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:55:06,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:55:06,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:55:06,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:55:06,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:55:05" (1/3) ... [2024-10-11 17:55:06,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4888fd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:06, skipping insertion in model container [2024-10-11 17:55:06,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:06" (2/3) ... [2024-10-11 17:55:06,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4888fd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:06, skipping insertion in model container [2024-10-11 17:55:06,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:06" (3/3) ... [2024-10-11 17:55:06,776 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2024-10-11 17:55:06,788 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:55:06,788 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 17:55:06,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:55:06,834 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@24a673b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:55:06,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 17:55:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:06,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:06,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:06,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 155876, now seen corresponding path program 1 times [2024-10-11 17:55:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387342078] [2024-10-11 17:55:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387342078] [2024-10-11 17:55:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387342078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194376176] [2024-10-11 17:55:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:07,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:07,128 INFO L87 Difference]: Start difference. First operand has 79 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,291 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-10-11 17:55:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,300 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:55:07,300 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:55:07,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:07,304 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 71 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 59 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:55:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 17:55:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-10-11 17:55:07,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 3 [2024-10-11 17:55:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,330 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-10-11 17:55:07,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-10-11 17:55:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:07,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:55:07,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 155877, now seen corresponding path program 1 times [2024-10-11 17:55:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132429657] [2024-10-11 17:55:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132429657] [2024-10-11 17:55:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132429657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025844052] [2024-10-11 17:55:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:07,476 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,597 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-11 17:55:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,599 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:55:07,600 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 17:55:07,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:07,601 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 17:55:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2024-10-11 17:55:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-11 17:55:07,613 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 3 [2024-10-11 17:55:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,613 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-11 17:55:07,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-11 17:55:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:07,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:55:07,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash 4832136, now seen corresponding path program 1 times [2024-10-11 17:55:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274802151] [2024-10-11 17:55:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274802151] [2024-10-11 17:55:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274802151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029663839] [2024-10-11 17:55:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,671 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,728 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-11 17:55:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,730 INFO L225 Difference]: With dead ends: 68 [2024-10-11 17:55:07,730 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 17:55:07,732 INFO L431 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 [2024-10-11 17:55:07,733 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 17:55:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 17:55:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-11 17:55:07,738 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 4 [2024-10-11 17:55:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,738 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-11 17:55:07,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-11 17:55:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:07,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:55:07,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash 4832137, now seen corresponding path program 1 times [2024-10-11 17:55:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092911024] [2024-10-11 17:55:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092911024] [2024-10-11 17:55:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092911024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21386585] [2024-10-11 17:55:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,794 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,837 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-11 17:55:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,838 INFO L225 Difference]: With dead ends: 64 [2024-10-11 17:55:07,839 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 17:55:07,839 INFO L431 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 [2024-10-11 17:55:07,840 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 17:55:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 17:55:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-10-11 17:55:07,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2024-10-11 17:55:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,849 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-10-11 17:55:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-10-11 17:55:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:55:07,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:07,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:55:07,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 214691204, now seen corresponding path program 1 times [2024-10-11 17:55:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051684091] [2024-10-11 17:55:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051684091] [2024-10-11 17:55:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051684091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107684206] [2024-10-11 17:55:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:07,976 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,107 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-10-11 17:55:08,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:08,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:55:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,108 INFO L225 Difference]: With dead ends: 71 [2024-10-11 17:55:08,108 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 17:55:08,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:08,109 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 283 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 17:55:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-11 17:55:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.744186046511628) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-10-11 17:55:08,113 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 8 [2024-10-11 17:55:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-10-11 17:55:08,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-10-11 17:55:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:55:08,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:55:08,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1527146394, now seen corresponding path program 1 times [2024-10-11 17:55:08,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374555] [2024-10-11 17:55:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658374555] [2024-10-11 17:55:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658374555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660953352] [2024-10-11 17:55:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:08,230 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,351 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-11 17:55:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:08,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 17:55:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,352 INFO L225 Difference]: With dead ends: 79 [2024-10-11 17:55:08,352 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 17:55:08,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:08,353 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 17:55:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-10-11 17:55:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-11 17:55:08,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 12 [2024-10-11 17:55:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,357 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-11 17:55:08,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-11 17:55:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:55:08,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:55:08,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1527146395, now seen corresponding path program 1 times [2024-10-11 17:55:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091447732] [2024-10-11 17:55:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091447732] [2024-10-11 17:55:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091447732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:08,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756656682] [2024-10-11 17:55:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:08,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:08,535 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,656 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-10-11 17:55:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 17:55:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,657 INFO L225 Difference]: With dead ends: 79 [2024-10-11 17:55:08,657 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 17:55:08,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:08,658 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 125 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 17:55:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-10-11 17:55:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.697674418604651) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-10-11 17:55:08,661 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 12 [2024-10-11 17:55:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,662 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-10-11 17:55:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-10-11 17:55:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:08,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:55:08,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash 97951334, now seen corresponding path program 1 times [2024-10-11 17:55:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956614656] [2024-10-11 17:55:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956614656] [2024-10-11 17:55:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956614656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000481129] [2024-10-11 17:55:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:08,712 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,738 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2024-10-11 17:55:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,739 INFO L225 Difference]: With dead ends: 65 [2024-10-11 17:55:08,739 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 17:55:08,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:08,739 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 17:55:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-11 17:55:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-10-11 17:55:08,745 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 13 [2024-10-11 17:55:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-10-11 17:55:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-10-11 17:55:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:55:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:55:08,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1291064318, now seen corresponding path program 1 times [2024-10-11 17:55:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921549596] [2024-10-11 17:55:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921549596] [2024-10-11 17:55:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921549596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90942743] [2024-10-11 17:55:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:08,973 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,077 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-10-11 17:55:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:55:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,078 INFO L225 Difference]: With dead ends: 64 [2024-10-11 17:55:09,079 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 17:55:09,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:09,079 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 117 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 17:55:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 17:55:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.641025641025641) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-10-11 17:55:09,082 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 14 [2024-10-11 17:55:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,082 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-10-11 17:55:09,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-10-11 17:55:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:55:09,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:55:09,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1291064319, now seen corresponding path program 1 times [2024-10-11 17:55:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484955765] [2024-10-11 17:55:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484955765] [2024-10-11 17:55:09,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484955765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:09,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072201414] [2024-10-11 17:55:09,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,167 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,235 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2024-10-11 17:55:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:55:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,236 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:55:09,236 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 17:55:09,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:09,237 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 17:55:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 17:55:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2024-10-11 17:55:09,239 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 14 [2024-10-11 17:55:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2024-10-11 17:55:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2024-10-11 17:55:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:55:09,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:55:09,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1368288191, now seen corresponding path program 1 times [2024-10-11 17:55:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911460724] [2024-10-11 17:55:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911460724] [2024-10-11 17:55:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911460724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6076855] [2024-10-11 17:55:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:09,450 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,611 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-10-11 17:55:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:09,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:55:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,612 INFO L225 Difference]: With dead ends: 94 [2024-10-11 17:55:09,612 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:55:09,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:09,613 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 199 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:55:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2024-10-11 17:55:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-10-11 17:55:09,616 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 15 [2024-10-11 17:55:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,616 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-10-11 17:55:09,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-10-11 17:55:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:09,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:55:09,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash 532739137, now seen corresponding path program 1 times [2024-10-11 17:55:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081459659] [2024-10-11 17:55:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081459659] [2024-10-11 17:55:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081459659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110197719] [2024-10-11 17:55:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:09,871 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,047 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-10-11 17:55:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:55:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,048 INFO L225 Difference]: With dead ends: 93 [2024-10-11 17:55:10,048 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 17:55:10,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:10,049 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 17:55:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2024-10-11 17:55:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.510204081632653) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-10-11 17:55:10,052 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 16 [2024-10-11 17:55:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,052 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-10-11 17:55:10,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-10-11 17:55:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:10,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:55:10,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1448475207, now seen corresponding path program 1 times [2024-10-11 17:55:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195697697] [2024-10-11 17:55:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195697697] [2024-10-11 17:55:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195697697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572765514] [2024-10-11 17:55:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:10,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:10,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:55:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:55:10,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:10,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:10,428 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 17:55:10,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 17:55:10,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:55:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:10,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:55:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:10,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:10,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-11 17:55:10,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:10,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-10-11 17:55:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:11,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572765514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:11,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:11,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 17:55:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570306802] [2024-10-11 17:55:11,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:55:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:55:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:55:11,215 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:11,488 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-10-11 17:55:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:11,490 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:55:11,490 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:55:11,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:55:11,491 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:11,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 227 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:55:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-11 17:55:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.489795918367347) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-10-11 17:55:11,493 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 16 [2024-10-11 17:55:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:11,494 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-10-11 17:55:11,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-10-11 17:55:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:11,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:11,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:11,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:11,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 17:55:11,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1448475208, now seen corresponding path program 1 times [2024-10-11 17:55:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946282163] [2024-10-11 17:55:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946282163] [2024-10-11 17:55:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946282163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781199810] [2024-10-11 17:55:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:11,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:11,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:55:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 17:55:12,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:12,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:12,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:12,146 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:55:12,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 17:55:12,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-11 17:55:12,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 17:55:12,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 17:55:12,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:12,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:12,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 17:55:12,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 17:55:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:12,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:12,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 17:55:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-10-11 17:55:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-10-11 17:55:12,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:12,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-10-11 17:55:12,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-10-11 17:55:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781199810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:12,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-11 17:55:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951944050] [2024-10-11 17:55:12,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 17:55:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 17:55:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:55:12,694 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,081 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-11 17:55:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:13,082 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,082 INFO L225 Difference]: With dead ends: 71 [2024-10-11 17:55:13,083 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 17:55:13,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:55:13,083 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 80 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 322 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 17:55:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-11 17:55:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.469387755102041) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-11 17:55:13,085 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 16 [2024-10-11 17:55:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,085 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-11 17:55:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-11 17:55:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:55:13,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:55:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:13,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -664955837, now seen corresponding path program 1 times [2024-10-11 17:55:13,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084302977] [2024-10-11 17:55:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084302977] [2024-10-11 17:55:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084302977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550075102] [2024-10-11 17:55:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:13,501 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,704 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 17:55:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:55:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,705 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:55:13,705 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:55:13,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:13,708 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 163 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:55:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-10-11 17:55:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.46) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-10-11 17:55:13,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 17 [2024-10-11 17:55:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,711 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-10-11 17:55:13,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-10-11 17:55:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:13,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:55:13,712 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash 861205636, now seen corresponding path program 1 times [2024-10-11 17:55:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176312200] [2024-10-11 17:55:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176312200] [2024-10-11 17:55:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176312200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449745221] [2024-10-11 17:55:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:13,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:13,838 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,931 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-10-11 17:55:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,932 INFO L225 Difference]: With dead ends: 69 [2024-10-11 17:55:13,932 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 17:55:13,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:13,932 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 40 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 17:55:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 17:55:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-11 17:55:13,934 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 18 [2024-10-11 17:55:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,934 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-11 17:55:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-11 17:55:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:13,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:55:13,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 861205637, now seen corresponding path program 1 times [2024-10-11 17:55:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639566519] [2024-10-11 17:55:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639566519] [2024-10-11 17:55:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639566519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999498843] [2024-10-11 17:55:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:13,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:13,989 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,028 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-10-11 17:55:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,029 INFO L225 Difference]: With dead ends: 64 [2024-10-11 17:55:14,029 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 17:55:14,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:14,030 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 17:55:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 17:55:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.34) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-11 17:55:14,032 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 18 [2024-10-11 17:55:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,032 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-11 17:55:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-11 17:55:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:55:14,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:14,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:55:14,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 927570983, now seen corresponding path program 1 times [2024-10-11 17:55:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94353114] [2024-10-11 17:55:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94353114] [2024-10-11 17:55:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94353114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808748306] [2024-10-11 17:55:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:14,102 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,150 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-10-11 17:55:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:55:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,151 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:55:14,151 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 17:55:14,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:14,152 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 97 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 17:55:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 17:55:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-10-11 17:55:14,153 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 19 [2024-10-11 17:55:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-10-11 17:55:14,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-10-11 17:55:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:55:14,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:14,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:55:14,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1310070492, now seen corresponding path program 1 times [2024-10-11 17:55:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110073066] [2024-10-11 17:55:14,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110073066] [2024-10-11 17:55:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110073066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022733637] [2024-10-11 17:55:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:14,240 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,294 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-10-11 17:55:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 17:55:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,296 INFO L225 Difference]: With dead ends: 62 [2024-10-11 17:55:14,296 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 17:55:14,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:14,296 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 17:55:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 17:55:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.3) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-10-11 17:55:14,298 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 20 [2024-10-11 17:55:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,299 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-10-11 17:55:14,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-10-11 17:55:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:14,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:55:14,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1957479479, now seen corresponding path program 1 times [2024-10-11 17:55:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105724498] [2024-10-11 17:55:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105724498] [2024-10-11 17:55:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105724498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:55:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603174412] [2024-10-11 17:55:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:55:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:55:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:14,620 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,902 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-11 17:55:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:55:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:55:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,903 INFO L225 Difference]: With dead ends: 78 [2024-10-11 17:55:14,903 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 17:55:14,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:55:14,904 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 17:55:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2024-10-11 17:55:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-10-11 17:55:14,905 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 21 [2024-10-11 17:55:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,905 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-10-11 17:55:14,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-10-11 17:55:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:55:14,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:14,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:55:14,906 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -552321593, now seen corresponding path program 1 times [2024-10-11 17:55:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794895898] [2024-10-11 17:55:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794895898] [2024-10-11 17:55:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794895898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746975392] [2024-10-11 17:55:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:15,002 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:15,072 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-10-11 17:55:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 17:55:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:15,073 INFO L225 Difference]: With dead ends: 65 [2024-10-11 17:55:15,073 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 17:55:15,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:15,074 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:15,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 17:55:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 17:55:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-11 17:55:15,075 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 22 [2024-10-11 17:55:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-11 17:55:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-11 17:55:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:15,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:15,076 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 17:55:15,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:55:15,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash -191373720, now seen corresponding path program 1 times [2024-10-11 17:55:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:15,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762817427] [2024-10-11 17:55:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:15,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762817427] [2024-10-11 17:55:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762817427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:55:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051287904] [2024-10-11 17:55:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:55:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:15,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:55:15,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:15,741 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:16,077 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-10-11 17:55:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:55:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 17:55:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:16,079 INFO L225 Difference]: With dead ends: 96 [2024-10-11 17:55:16,079 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:55:16,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:55:16,080 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:16,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 172 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:55:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-11 17:55:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-11 17:55:16,081 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 25 [2024-10-11 17:55:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:16,082 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-11 17:55:16,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-11 17:55:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:16,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:16,083 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 17:55:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:55:16,084 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -191372532, now seen corresponding path program 1 times [2024-10-11 17:55:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652415109] [2024-10-11 17:55:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652415109] [2024-10-11 17:55:16,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652415109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:16,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864464658] [2024-10-11 17:55:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:16,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:16,142 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:16,169 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-10-11 17:55:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 17:55:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:16,170 INFO L225 Difference]: With dead ends: 93 [2024-10-11 17:55:16,170 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 17:55:16,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:16,171 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:16,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 17:55:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-10-11 17:55:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-10-11 17:55:16,173 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 25 [2024-10-11 17:55:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:16,174 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-10-11 17:55:16,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-10-11 17:55:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:16,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:16,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:16,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:55:16,174 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:16,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -211721831, now seen corresponding path program 1 times [2024-10-11 17:55:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713559650] [2024-10-11 17:55:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:55:16,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713559650] [2024-10-11 17:55:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713559650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486492958] [2024-10-11 17:55:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:16,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:55:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-11 17:55:16,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:16,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:17,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:17,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:17,047 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:55:17,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 17:55:17,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:55:17,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-11 17:55:17,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:55:17,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:17,361 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:55:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-10-11 17:55:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2024-10-11 17:55:17,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 17:55:17,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-10-11 17:55:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 17:55:17,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:17,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-10-11 17:55:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:17,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:18,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2024-10-11 17:55:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 178 [2024-10-11 17:55:24,260 INFO L349 Elim1Store]: treesize reduction 407, result has 51.2 percent of original size [2024-10-11 17:55:24,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 2891 treesize of output 2594 [2024-10-11 17:55:25,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:25,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 2016 treesize of output 2842 [2024-10-11 17:55:26,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:26,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1730 treesize of output 2000