./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:05:22,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:05:22,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:05:22,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:05:22,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:05:22,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:05:22,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:05:22,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:05:22,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:05:22,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:05:22,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:05:22,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:05:22,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:05:22,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:05:22,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:05:22,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:05:22,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:05:22,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:05:22,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:05:22,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:05:22,919 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:05:22,922 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:05:22,922 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:05:22,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:05:22,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:05:22,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:05:22,923 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:05:22,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:05:22,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:05:22,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:05:22,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:05:22,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:05:22,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:05:22,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:05:22,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:05:22,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:05:22,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:05:22,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:05:22,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:05:22,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:05:22,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:05:22,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:05:22,929 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/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/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 -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2024-11-09 08:05:23,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:05:23,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:05:23,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:05:23,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:05:23,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:05:23,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2024-11-09 08:05:24,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:05:24,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:05:24,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2024-11-09 08:05:24,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1db44836/280572f10b28417f9889af09319198a0/FLAG8a039bd41 [2024-11-09 08:05:25,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1db44836/280572f10b28417f9889af09319198a0 [2024-11-09 08:05:25,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:05:25,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:05:25,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:05:25,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:05:25,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:05:25,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6712a8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25, skipping insertion in model container [2024-11-09 08:05:25,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:05:25,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:05:25,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:05:25,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:05:25,618 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:05:25,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25 WrapperNode [2024-11-09 08:05:25,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:05:25,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:05:25,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:05:25,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:05:25,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,667 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2024-11-09 08:05:25,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:05:25,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:05:25,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:05:25,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:05:25,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,699 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-09 08:05:25,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:05:25,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:05:25,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:05:25,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:05:25,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (1/1) ... [2024-11-09 08:05:25,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:05:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:25,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:05:25,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:05:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:05:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:05:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:05:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:05:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:05:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:05:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:05:25,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:05:25,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:05:25,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:05:26,061 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 08:05:26,062 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:05:26,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:05:26,071 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 08:05:26,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:05:26 BoogieIcfgContainer [2024-11-09 08:05:26,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:05:26,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:05:26,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:05:26,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:05:26,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:05:25" (1/3) ... [2024-11-09 08:05:26,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c763029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:05:26, skipping insertion in model container [2024-11-09 08:05:26,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:25" (2/3) ... [2024-11-09 08:05:26,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c763029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:05:26, skipping insertion in model container [2024-11-09 08:05:26,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:05:26" (3/3) ... [2024-11-09 08:05:26,077 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2024-11-09 08:05:26,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:05:26,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-09 08:05:26,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:05:26,135 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;@227df818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:05:26,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-09 08:05:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 75 states have internal predecessors, (85), 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-11-09 08:05:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:05:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:26,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:05:26,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:26,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-09 08:05:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941650492] [2024-11-09 08:05:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941650492] [2024-11-09 08:05:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941650492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:05:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742721185] [2024-11-09 08:05:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:26,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:26,485 INFO L87 Difference]: Start difference. First operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 75 states have internal predecessors, (85), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:05:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:26,542 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-11-09 08:05:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 08:05:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:26,550 INFO L225 Difference]: With dead ends: 73 [2024-11-09 08:05:26,550 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 08:05:26,551 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-11-09 08:05:26,554 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:26,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 08:05:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 08:05:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.825) 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-11-09 08:05:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-09 08:05:26,580 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 5 [2024-11-09 08:05:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:26,580 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-09 08:05:26,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:05:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-09 08:05:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:05:26,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:26,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:05:26,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:05:26,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:26,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-09 08:05:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:26,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657960106] [2024-11-09 08:05:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:26,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:26,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657960106] [2024-11-09 08:05:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657960106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:26,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:05:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123334425] [2024-11-09 08:05:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:26,670 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:05:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:26,751 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-09 08:05:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 08:05:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:26,754 INFO L225 Difference]: With dead ends: 68 [2024-11-09 08:05:26,754 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 08:05:26,754 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-11-09 08:05:26,755 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:26,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 08:05:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 08:05:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.775) 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-11-09 08:05:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-09 08:05:26,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5 [2024-11-09 08:05:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:26,764 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-09 08:05:26,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:05:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-09 08:05:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:05:26,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:26,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:05:26,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1808567273, now seen corresponding path program 1 times [2024-11-09 08:05:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096824471] [2024-11-09 08:05:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096824471] [2024-11-09 08:05:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096824471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:05:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431378970] [2024-11-09 08:05:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:26,835 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 08:05:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:26,848 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-09 08:05:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-09 08:05:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:26,849 INFO L225 Difference]: With dead ends: 79 [2024-11-09 08:05:26,849 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 08:05:26,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 08:05:26,850 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:26,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 08:05:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2024-11-09 08:05:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.7560975609756098) 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-11-09 08:05:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-09 08:05:26,855 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2024-11-09 08:05:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:26,855 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-09 08:05:26,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 08:05:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-09 08:05:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:05:26,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:26,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:26,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:05:26,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:26,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-09 08:05:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:26,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433727220] [2024-11-09 08:05:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433727220] [2024-11-09 08:05:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433727220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:26,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126337130] [2024-11-09 08:05:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:26,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:26,943 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-09 08:05:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:27,039 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-09 08:05:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-09 08:05:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:27,041 INFO L225 Difference]: With dead ends: 68 [2024-11-09 08:05:27,041 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 08:05:27,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:27,042 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:27,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 08:05:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 08:05:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) 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-11-09 08:05:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-09 08:05:27,046 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 9 [2024-11-09 08:05:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-09 08:05:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-09 08:05:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-09 08:05:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:05:27,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:27,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:05:27,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:27,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-09 08:05:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980690787] [2024-11-09 08:05:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980690787] [2024-11-09 08:05:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980690787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609037117] [2024-11-09 08:05:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:27,163 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-09 08:05:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:27,227 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-09 08:05:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-09 08:05:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:27,228 INFO L225 Difference]: With dead ends: 67 [2024-11-09 08:05:27,228 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 08:05:27,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:27,229 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:27,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 08:05:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 08:05:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 66 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-11-09 08:05:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-09 08:05:27,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 9 [2024-11-09 08:05:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-09 08:05:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-09 08:05:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-09 08:05:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:05:27,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:27,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:05:27,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -718760675, now seen corresponding path program 1 times [2024-11-09 08:05:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310817765] [2024-11-09 08:05:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310817765] [2024-11-09 08:05:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310817765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829683048] [2024-11-09 08:05:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:27,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:27,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:05:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:27,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:05:27,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:27,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829683048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:27,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 08:05:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235799529] [2024-11-09 08:05:27,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:27,492 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 08:05:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:27,511 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-09 08:05:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:05:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 08:05:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:27,512 INFO L225 Difference]: With dead ends: 76 [2024-11-09 08:05:27,512 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 08:05:27,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:27,513 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:27,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 188 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 08:05:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 08:05:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 75 states have internal predecessors, (79), 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-11-09 08:05:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-09 08:05:27,520 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 16 [2024-11-09 08:05:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:27,520 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-09 08:05:27,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 08:05:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-09 08:05:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:05:27,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:27,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:27,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 08:05:27,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 08:05:27,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:27,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307113, now seen corresponding path program 2 times [2024-11-09 08:05:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761105895] [2024-11-09 08:05:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761105895] [2024-11-09 08:05:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761105895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284297770] [2024-11-09 08:05:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:05:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:05:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:05:27,802 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-11-09 08:05:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:27,812 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-11-09 08:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:05:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 25 [2024-11-09 08:05:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:27,814 INFO L225 Difference]: With dead ends: 119 [2024-11-09 08:05:27,814 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 08:05:27,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-09 08:05:27,815 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:27,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 184 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 08:05:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-11-09 08:05:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 76 states have internal predecessors, (80), 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-11-09 08:05:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-09 08:05:27,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 25 [2024-11-09 08:05:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-09 08:05:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-11-09 08:05:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-09 08:05:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:05:27,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:27,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:05:27,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:27,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307113, now seen corresponding path program 1 times [2024-11-09 08:05:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243518788] [2024-11-09 08:05:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:05:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243518788] [2024-11-09 08:05:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243518788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046905044] [2024-11-09 08:05:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:27,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:27,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:27,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:05:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:28,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 08:05:28,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:28,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:05:28,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:28,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:28,184 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:05:28,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:05:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:05:28,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:05:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046905044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:28,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-11-09 08:05:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453462489] [2024-11-09 08:05:28,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:28,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:05:28,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:05:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:05:28,323 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 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-11-09 08:05:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:28,567 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-09 08:05:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:05:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 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 25 [2024-11-09 08:05:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:28,569 INFO L225 Difference]: With dead ends: 109 [2024-11-09 08:05:28,569 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 08:05:28,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:28,569 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 154 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:28,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 129 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 08:05:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2024-11-09 08:05:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 75 states have internal predecessors, (80), 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-11-09 08:05:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-09 08:05:28,573 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 25 [2024-11-09 08:05:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-09 08:05:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 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-11-09 08:05:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-09 08:05:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:05:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:28,574 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:28,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 08:05:28,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307114, now seen corresponding path program 1 times [2024-11-09 08:05:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937745793] [2024-11-09 08:05:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937745793] [2024-11-09 08:05:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937745793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477367966] [2024-11-09 08:05:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:28,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:28,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:05:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:29,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 08:05:29,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:29,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:05:29,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:29,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 14 treesize of output 9 [2024-11-09 08:05:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:29,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:29,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:33,530 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_301 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_20| 1)) (forall ((v_ArrVal_302 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_301) |v_ULTIMATE.start_node_create_~temp~0#1.base_20| v_ArrVal_302) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2024-11-09 08:05:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 08:05:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477367966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:33,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 14 [2024-11-09 08:05:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2831966] [2024-11-09 08:05:33,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 08:05:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 08:05:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2024-11-09 08:05:33,572 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 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-11-09 08:05:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:33,936 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-09 08:05:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:05:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 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) Word has length 25 [2024-11-09 08:05:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:33,937 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:05:33,941 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:05:33,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=93, Invalid=182, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:05:33,942 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 227 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:33,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 145 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2024-11-09 08:05:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:05:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2024-11-09 08:05:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4230769230769231) 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-11-09 08:05:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-09 08:05:33,948 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2024-11-09 08:05:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:33,948 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-09 08:05:33,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 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-11-09 08:05:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-09 08:05:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:05:33,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:33,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:33,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:05:34,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:34,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:34,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2130912971, now seen corresponding path program 1 times [2024-11-09 08:05:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966778903] [2024-11-09 08:05:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966778903] [2024-11-09 08:05:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966778903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:05:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683583208] [2024-11-09 08:05:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:05:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:05:34,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:34,352 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-11-09 08:05:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:34,544 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-09 08:05:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:05:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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 26 [2024-11-09 08:05:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:34,547 INFO L225 Difference]: With dead ends: 100 [2024-11-09 08:05:34,547 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 08:05:34,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:05:34,548 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 48 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:34,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 08:05:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2024-11-09 08:05:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 71 states have internal predecessors, (76), 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-11-09 08:05:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 08:05:34,556 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 26 [2024-11-09 08:05:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 08:05:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-11-09 08:05:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 08:05:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:05:34,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:34,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:34,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:05:34,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2130912972, now seen corresponding path program 1 times [2024-11-09 08:05:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612634182] [2024-11-09 08:05:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612634182] [2024-11-09 08:05:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612634182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:34,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:05:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694432958] [2024-11-09 08:05:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:05:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:05:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:34,776 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-11-09 08:05:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:35,017 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-11-09 08:05:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:05:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2024-11-09 08:05:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:35,018 INFO L225 Difference]: With dead ends: 109 [2024-11-09 08:05:35,019 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 08:05:35,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:05:35,023 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 55 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:35,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 333 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 08:05:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2024-11-09 08:05:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 87 states have internal predecessors, (105), 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-11-09 08:05:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2024-11-09 08:05:35,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 26 [2024-11-09 08:05:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:35,030 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2024-11-09 08:05:35,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-11-09 08:05:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2024-11-09 08:05:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:05:35,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:35,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:35,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:05:35,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:35,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1883258256, now seen corresponding path program 1 times [2024-11-09 08:05:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599648348] [2024-11-09 08:05:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599648348] [2024-11-09 08:05:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599648348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:05:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302807816] [2024-11-09 08:05:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:05:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:05:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:35,193 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-11-09 08:05:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:35,306 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2024-11-09 08:05:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:05:35,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 29 [2024-11-09 08:05:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:35,307 INFO L225 Difference]: With dead ends: 87 [2024-11-09 08:05:35,307 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 08:05:35,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:05:35,308 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:35,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 325 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 08:05:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 08:05:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 86 states have internal predecessors, (104), 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-11-09 08:05:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-11-09 08:05:35,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 29 [2024-11-09 08:05:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:35,310 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-11-09 08:05:35,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-11-09 08:05:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-11-09 08:05:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:05:35,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:35,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:35,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:05:35,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:35,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1748967250, now seen corresponding path program 1 times [2024-11-09 08:05:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:35,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015323607] [2024-11-09 08:05:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015323607] [2024-11-09 08:05:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015323607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 08:05:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865915906] [2024-11-09 08:05:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:35,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 08:05:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 08:05:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:35,524 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-11-09 08:05:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:35,741 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2024-11-09 08:05:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 08:05:35,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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 30 [2024-11-09 08:05:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:35,743 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:05:35,743 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:05:35,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:05:35,744 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:35,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 268 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:05:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-09 08:05:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 92 states have internal predecessors, (116), 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-11-09 08:05:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-11-09 08:05:35,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2024-11-09 08:05:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:35,747 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-11-09 08:05:35,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-11-09 08:05:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-11-09 08:05:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:05:35,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:35,747 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:35,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:05:35,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1748967249, now seen corresponding path program 1 times [2024-11-09 08:05:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223013771] [2024-11-09 08:05:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223013771] [2024-11-09 08:05:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223013771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:05:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326929985] [2024-11-09 08:05:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:05:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:05:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:05:35,807 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-11-09 08:05:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:35,876 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2024-11-09 08:05:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:05:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 30 [2024-11-09 08:05:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:35,877 INFO L225 Difference]: With dead ends: 91 [2024-11-09 08:05:35,877 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 08:05:35,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:05:35,877 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:35,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 08:05:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 08:05:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.44) internal successors, (108), 90 states have internal predecessors, (108), 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-11-09 08:05:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-11-09 08:05:35,879 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 30 [2024-11-09 08:05:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:35,880 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-11-09 08:05:35,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-11-09 08:05:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-11-09 08:05:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:05:35,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:35,880 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:05:35,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1748536300, now seen corresponding path program 1 times [2024-11-09 08:05:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37214322] [2024-11-09 08:05:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37214322] [2024-11-09 08:05:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37214322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:05:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086606647] [2024-11-09 08:05:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:35,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:05:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:05:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:35,997 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-11-09 08:05:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:36,175 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2024-11-09 08:05:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 08:05:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2024-11-09 08:05:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:36,176 INFO L225 Difference]: With dead ends: 108 [2024-11-09 08:05:36,176 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 08:05:36,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:05:36,176 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:36,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 340 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 08:05:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2024-11-09 08:05:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 93 states have internal predecessors, (111), 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-11-09 08:05:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-11-09 08:05:36,178 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 30 [2024-11-09 08:05:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:36,178 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-11-09 08:05:36,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-11-09 08:05:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-11-09 08:05:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:05:36,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:36,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:05:36,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:36,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1629949454, now seen corresponding path program 1 times [2024-11-09 08:05:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:36,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154031070] [2024-11-09 08:05:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154031070] [2024-11-09 08:05:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154031070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387182755] [2024-11-09 08:05:36,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:36,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:36,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:36,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:36,230 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-11-09 08:05:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:36,289 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2024-11-09 08:05:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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 31 [2024-11-09 08:05:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:36,290 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:05:36,290 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:05:36,290 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-11-09 08:05:36,291 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:36,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 141 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:05:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 08:05:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 92 states have internal predecessors, (110), 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-11-09 08:05:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2024-11-09 08:05:36,293 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 31 [2024-11-09 08:05:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:36,293 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2024-11-09 08:05:36,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-11-09 08:05:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2024-11-09 08:05:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 08:05:36,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:36,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:36,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:05:36,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:36,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1425315259, now seen corresponding path program 1 times [2024-11-09 08:05:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:36,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405978188] [2024-11-09 08:05:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:36,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405978188] [2024-11-09 08:05:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405978188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 08:05:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948867949] [2024-11-09 08:05:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:36,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 08:05:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 08:05:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:05:36,704 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 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-11-09 08:05:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:37,101 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2024-11-09 08:05:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 08:05:37,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 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 32 [2024-11-09 08:05:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:37,101 INFO L225 Difference]: With dead ends: 106 [2024-11-09 08:05:37,101 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 08:05:37,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2024-11-09 08:05:37,102 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:37,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 655 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:05:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 08:05:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-11-09 08:05:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 92 states have internal predecessors, (109), 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-11-09 08:05:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2024-11-09 08:05:37,104 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 32 [2024-11-09 08:05:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:37,104 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2024-11-09 08:05:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 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-11-09 08:05:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2024-11-09 08:05:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 08:05:37,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:37,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:37,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:05:37,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1011174575, now seen corresponding path program 1 times [2024-11-09 08:05:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075159886] [2024-11-09 08:05:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075159886] [2024-11-09 08:05:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075159886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751759341] [2024-11-09 08:05:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:37,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:37,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:37,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:37,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:05:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:37,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:05:37,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:37,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:37,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:37,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:05:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751759341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:05:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-09 08:05:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37092250] [2024-11-09 08:05:37,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:05:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:05:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 08:05:37,464 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-11-09 08:05:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:37,557 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2024-11-09 08:05:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:05:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 32 [2024-11-09 08:05:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:37,558 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:05:37,558 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:05:37,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-09 08:05:37,558 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:37,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 142 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:05:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:05:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 91 states have internal predecessors, (108), 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-11-09 08:05:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2024-11-09 08:05:37,560 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 32 [2024-11-09 08:05:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:37,561 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-09 08:05:37,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-11-09 08:05:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2024-11-09 08:05:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:05:37,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:37,561 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:37,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 08:05:37,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 08:05:37,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:37,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash -366548792, now seen corresponding path program 1 times [2024-11-09 08:05:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:37,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199736907] [2024-11-09 08:05:37,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199736907] [2024-11-09 08:05:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199736907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443519062] [2024-11-09 08:05:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:38,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:38,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:05:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:38,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 08:05:38,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:38,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:05:38,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:05:38,692 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 16 treesize of output 11 [2024-11-09 08:05:38,819 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 19 treesize of output 1 [2024-11-09 08:05:38,824 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 19 treesize of output 1 [2024-11-09 08:05:39,079 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 82 treesize of output 58 [2024-11-09 08:05:39,081 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 62 treesize of output 42 [2024-11-09 08:05:39,169 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 39 treesize of output 21 [2024-11-09 08:05:39,172 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 32 treesize of output 14 [2024-11-09 08:05:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:39,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:39,513 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 64 treesize of output 48 [2024-11-09 08:05:39,516 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 52 treesize of output 36 [2024-11-09 08:05:39,986 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 49 treesize of output 45 [2024-11-09 08:05:40,004 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 08:05:40,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-09 08:05:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443519062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:40,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:40,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 16] total 51 [2024-11-09 08:05:40,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739910382] [2024-11-09 08:05:40,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:40,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 08:05:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 08:05:40,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2493, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 08:05:40,129 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 52 states have internal predecessors, (99), 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-11-09 08:05:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:41,838 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2024-11-09 08:05:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:05:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 52 states have internal predecessors, (99), 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 34 [2024-11-09 08:05:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:41,839 INFO L225 Difference]: With dead ends: 125 [2024-11-09 08:05:41,839 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 08:05:41,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=414, Invalid=5136, Unknown=0, NotChecked=0, Total=5550 [2024-11-09 08:05:41,841 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 195 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:41,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 706 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 08:05:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 08:05:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2024-11-09 08:05:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.372093023255814) internal successors, (118), 98 states have internal predecessors, (118), 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-11-09 08:05:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2024-11-09 08:05:41,848 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 34 [2024-11-09 08:05:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:41,848 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2024-11-09 08:05:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 52 states have internal predecessors, (99), 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-11-09 08:05:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2024-11-09 08:05:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:05:41,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:41,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:41,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 08:05:42,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:42,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -366548793, now seen corresponding path program 1 times [2024-11-09 08:05:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181448802] [2024-11-09 08:05:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181448802] [2024-11-09 08:05:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181448802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285816955] [2024-11-09 08:05:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:42,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:42,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:05:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:42,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 08:05:42,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:42,882 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:05:42,882 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 19 treesize of output 16 [2024-11-09 08:05:42,967 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 19 treesize of output 1 [2024-11-09 08:05:43,162 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 49 treesize of output 33 [2024-11-09 08:05:43,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 37 treesize of output 25 [2024-11-09 08:05:43,254 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 13 [2024-11-09 08:05:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:43,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:43,366 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 28 treesize of output 20 [2024-11-09 08:05:43,369 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 24 treesize of output 16 [2024-11-09 08:05:43,571 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:05:43,572 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 30 treesize of output 1 [2024-11-09 08:05:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285816955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:43,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:43,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 13] total 38 [2024-11-09 08:05:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995577709] [2024-11-09 08:05:43,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:43,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 08:05:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 08:05:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 08:05:43,574 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 39 states have internal predecessors, (90), 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-11-09 08:05:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:44,594 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2024-11-09 08:05:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 08:05:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 39 states have internal predecessors, (90), 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 34 [2024-11-09 08:05:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:44,599 INFO L225 Difference]: With dead ends: 118 [2024-11-09 08:05:44,599 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 08:05:44,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=296, Invalid=3010, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 08:05:44,604 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 122 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:44,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 535 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:05:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 08:05:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-11-09 08:05:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 98 states have internal predecessors, (117), 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-11-09 08:05:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2024-11-09 08:05:44,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 34 [2024-11-09 08:05:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:44,613 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2024-11-09 08:05:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 39 states have internal predecessors, (90), 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-11-09 08:05:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2024-11-09 08:05:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:44,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:44,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:44,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 08:05:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:44,815 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:44,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash -66070095, now seen corresponding path program 1 times [2024-11-09 08:05:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225172277] [2024-11-09 08:05:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:45,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225172277] [2024-11-09 08:05:45,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225172277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239707293] [2024-11-09 08:05:45,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:45,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:05:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:45,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 08:05:45,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:45,327 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 17 treesize of output 9 [2024-11-09 08:05:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:45,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:45,368 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-09 08:05:45,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:05:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239707293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:45,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 12 [2024-11-09 08:05:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133926745] [2024-11-09 08:05:45,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:45,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 08:05:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 08:05:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:45,372 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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-11-09 08:05:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:45,640 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2024-11-09 08:05:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 08:05:45,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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 36 [2024-11-09 08:05:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:45,641 INFO L225 Difference]: With dead ends: 118 [2024-11-09 08:05:45,641 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 08:05:45,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-09 08:05:45,643 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:45,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 223 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 08:05:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-09 08:05:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 100 states have internal predecessors, (119), 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-11-09 08:05:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2024-11-09 08:05:45,646 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 36 [2024-11-09 08:05:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2024-11-09 08:05:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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-11-09 08:05:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2024-11-09 08:05:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:45,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:45,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:45,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:45,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash -66070094, now seen corresponding path program 1 times [2024-11-09 08:05:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931639510] [2024-11-09 08:05:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931639510] [2024-11-09 08:05:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931639510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011871650] [2024-11-09 08:05:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:46,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:46,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:05:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 08:05:46,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:46,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011871650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:46,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 13 [2024-11-09 08:05:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861270598] [2024-11-09 08:05:46,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:46,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 08:05:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 08:05:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:05:46,263 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-11-09 08:05:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,661 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-09 08:05:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 08:05:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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 36 [2024-11-09 08:05:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,663 INFO L225 Difference]: With dead ends: 117 [2024-11-09 08:05:46,663 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 08:05:46,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-09 08:05:46,664 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 354 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 08:05:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2024-11-09 08:05:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 100 states have internal predecessors, (116), 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-11-09 08:05:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2024-11-09 08:05:46,674 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 36 [2024-11-09 08:05:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,674 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2024-11-09 08:05:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-11-09 08:05:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2024-11-09 08:05:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:46,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,674 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:05:46,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 08:05:46,875 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -897341486, now seen corresponding path program 1 times [2024-11-09 08:05:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545051662] [2024-11-09 08:05:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545051662] [2024-11-09 08:05:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545051662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746378680] [2024-11-09 08:05:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:46,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:05:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:05:47,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:47,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746378680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:47,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 08:05:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394580121] [2024-11-09 08:05:47,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:47,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:05:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:05:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:05:47,168 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-09 08:05:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:47,177 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-11-09 08:05:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 36 [2024-11-09 08:05:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:47,177 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:05:47,177 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:05:47,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:05:47,178 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 80 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:47,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:05:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-09 08:05:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.308411214953271) internal successors, (140), 119 states have internal predecessors, (140), 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-11-09 08:05:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-09 08:05:47,180 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 36 [2024-11-09 08:05:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:47,180 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-09 08:05:47,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-09 08:05:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-09 08:05:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:47,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:47,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:47,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:47,384 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -897341486, now seen corresponding path program 1 times [2024-11-09 08:05:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101867341] [2024-11-09 08:05:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:47,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101867341] [2024-11-09 08:05:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101867341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150347434] [2024-11-09 08:05:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:47,435 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:47,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:05:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 08:05:47,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:47,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:05:47,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:47,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:47,600 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:47,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:05:47,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:47,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:05:47,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:49,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_remove_last_#t~mem8#1.base| Int) (v_ArrVal_1268 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_39| 1) |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1)))) is different from false [2024-11-09 08:05:53,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_41| Int) (|ULTIMATE.start_sll_remove_last_#t~mem8#1.base| Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_39| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_41| 1)) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_41| v_ArrVal_1266) |v_ULTIMATE.start_node_create_~temp~0#1.base_39| 1) |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from false [2024-11-09 08:05:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-09 08:05:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150347434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:53,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 10] total 16 [2024-11-09 08:05:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407171763] [2024-11-09 08:05:53,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 08:05:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 08:05:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2024-11-09 08:05:53,441 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 17 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-11-09 08:05:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:53,678 INFO L93 Difference]: Finished difference Result 164 states and 189 transitions. [2024-11-09 08:05:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:05:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 17 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) Word has length 36 [2024-11-09 08:05:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:53,679 INFO L225 Difference]: With dead ends: 164 [2024-11-09 08:05:53,679 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 08:05:53,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=85, Invalid=227, Unknown=2, NotChecked=66, Total=380 [2024-11-09 08:05:53,680 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 118 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:53,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 221 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2024-11-09 08:05:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 08:05:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2024-11-09 08:05:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 124 states have internal predecessors, (146), 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-11-09 08:05:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2024-11-09 08:05:53,686 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 36 [2024-11-09 08:05:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2024-11-09 08:05:53,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 17 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-11-09 08:05:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2024-11-09 08:05:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:05:53,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:53,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:53,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 08:05:53,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 08:05:53,890 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2047782270, now seen corresponding path program 1 times [2024-11-09 08:05:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8854703] [2024-11-09 08:05:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8854703] [2024-11-09 08:05:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8854703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348395735] [2024-11-09 08:05:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:54,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:54,452 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:54,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:05:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:54,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 08:05:54,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:54,680 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-11-09 08:05:54,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 08:05:54,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:54,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 08:05:54,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 08:05:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:54,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:54,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 08:05:54,905 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 21 treesize of output 13 [2024-11-09 08:05:54,912 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 13 treesize of output 11 [2024-11-09 08:05:54,914 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 20 treesize of output 18 [2024-11-09 08:05:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348395735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:54,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2024-11-09 08:05:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914835155] [2024-11-09 08:05:54,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 08:05:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 08:05:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:05:54,939 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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-11-09 08:05:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:55,252 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2024-11-09 08:05:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 08:05:55,252 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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 37 [2024-11-09 08:05:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:55,252 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:05:55,252 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 08:05:55,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 08:05:55,253 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:55,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 527 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 08:05:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-09 08:05:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 116 states have internal predecessors, (137), 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-11-09 08:05:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2024-11-09 08:05:55,255 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 37 [2024-11-09 08:05:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:55,255 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2024-11-09 08:05:55,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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-11-09 08:05:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2024-11-09 08:05:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:05:55,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:55,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:55,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 08:05:55,456 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 931150289, now seen corresponding path program 1 times [2024-11-09 08:05:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053218618] [2024-11-09 08:05:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053218618] [2024-11-09 08:05:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053218618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947816864] [2024-11-09 08:05:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:56,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:56,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:56,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:05:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 08:05:56,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:56,413 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 19 treesize of output 1 [2024-11-09 08:05:56,554 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 27 treesize of output 19 [2024-11-09 08:05:56,555 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 23 treesize of output 15 [2024-11-09 08:05:56,608 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 21 treesize of output 9 [2024-11-09 08:05:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:56,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:56,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 08:05:56,729 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 14 [2024-11-09 08:05:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947816864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:56,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 33 [2024-11-09 08:05:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781818383] [2024-11-09 08:05:56,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:56,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 08:05:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 08:05:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 08:05:56,835 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 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-11-09 08:05:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:57,501 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2024-11-09 08:05:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 08:05:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 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 38 [2024-11-09 08:05:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:57,502 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:05:57,502 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 08:05:57,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 08:05:57,503 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 111 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:57,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 596 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:05:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 08:05:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-11-09 08:05:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 117 states have internal predecessors, (138), 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-11-09 08:05:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2024-11-09 08:05:57,505 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 38 [2024-11-09 08:05:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:57,505 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2024-11-09 08:05:57,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 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-11-09 08:05:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2024-11-09 08:05:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:05:57,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:57,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:57,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 08:05:57,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 08:05:57,710 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 08:05:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash 931202878, now seen corresponding path program 2 times [2024-11-09 08:05:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378293612] [2024-11-09 08:05:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378293612] [2024-11-09 08:05:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378293612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739221699] [2024-11-09 08:05:58,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:05:58,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:58,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:58,925 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:58,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:05:59,062 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:05:59,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:05:59,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 08:05:59,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:59,126 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 13 treesize of output 9 [2024-11-09 08:05:59,135 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 13 treesize of output 9 [2024-11-09 08:05:59,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:05:59,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:05:59,267 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 18 treesize of output 13 [2024-11-09 08:05:59,273 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 18 treesize of output 13 [2024-11-09 08:05:59,288 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 18 treesize of output 13 [2024-11-09 08:05:59,297 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 18 treesize of output 13 [2024-11-09 08:05:59,394 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 41 treesize of output 25 [2024-11-09 08:05:59,418 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 41 treesize of output 25 [2024-11-09 08:05:59,731 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 104 treesize of output 76 [2024-11-09 08:05:59,733 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 80 treesize of output 56