./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test25-2.c --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/ldv-regression/test25-2.c -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 04738ccb45e87cb71ee901a776c43e93b7c292454abcb1b1134d9ecc09485bab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:40:58,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:40:58,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:40:58,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:40:58,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:40:58,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:40:58,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:40:58,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:40:58,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:40:58,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:40:58,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:40:58,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:40:58,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:40:58,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:40:58,921 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:40:58,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:40:58,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:40:58,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:40:58,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:40:58,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:40:58,922 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:40:58,926 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:40:58,927 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:40:58,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:40:58,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:40:58,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:40:58,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:40:58,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:40:58,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:40:58,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:40:58,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:40:58,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:40:58,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:40:58,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:40:58,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:40:58,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:40:58,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:40:58,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:40:58,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:40:58,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:40:58,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:40:58,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:40:58,932 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 -> 04738ccb45e87cb71ee901a776c43e93b7c292454abcb1b1134d9ecc09485bab [2024-11-09 07:40:59,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:40:59,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:40:59,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:40:59,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:40:59,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:40:59,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-2.c [2024-11-09 07:41:00,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:41:00,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:41:00,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-2.c [2024-11-09 07:41:00,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d05e17a5/5573264584fc476abedc224a504fe754/FLAGfdcff46e5 [2024-11-09 07:41:00,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d05e17a5/5573264584fc476abedc224a504fe754 [2024-11-09 07:41:00,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:41:00,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:41:00,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:00,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:41:00,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:41:00,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:00" (1/1) ... [2024-11-09 07:41:00,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d4f08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:00, skipping insertion in model container [2024-11-09 07:41:00,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:00" (1/1) ... [2024-11-09 07:41:00,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:41:01,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:01,151 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:41:01,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:01,190 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:41:01,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01 WrapperNode [2024-11-09 07:41:01,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:01,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:01,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:41:01,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:41:01,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,248 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-09 07:41:01,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:01,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:41:01,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:41:01,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:41:01,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,288 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 4, 6]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-09 07:41:01,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:41:01,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:41:01,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:41:01,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:41:01,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (1/1) ... [2024-11-09 07:41:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:41:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:01,382 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 07:41:01,388 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 07:41:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:41:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:41:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:41:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:41:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:41:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:41:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:41:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:41:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:41:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:41:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:41:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:41:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:41:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:41:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:41:01,551 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:41:01,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:41:01,870 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-09 07:41:01,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:41:01,884 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:41:01,886 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:41:01,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:01 BoogieIcfgContainer [2024-11-09 07:41:01,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:41:01,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:41:01,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:41:01,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:41:01,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:41:00" (1/3) ... [2024-11-09 07:41:01,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30337c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:01, skipping insertion in model container [2024-11-09 07:41:01,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:01" (2/3) ... [2024-11-09 07:41:01,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30337c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:01, skipping insertion in model container [2024-11-09 07:41:01,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:01" (3/3) ... [2024-11-09 07:41:01,898 INFO L112 eAbstractionObserver]: Analyzing ICFG test25-2.c [2024-11-09 07:41:01,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:41:01,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-09 07:41:01,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:41:01,967 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;@3cda47e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:41:01,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 07:41:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.90625) internal successors, (61), 54 states have internal predecessors, (61), 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 07:41:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:01,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:01,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:01,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:01,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-09 07:41:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:01,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14321323] [2024-11-09 07:41:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:02,264 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 07:41:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14321323] [2024-11-09 07:41:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14321323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455673042] [2024-11-09 07:41:02,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:02,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:02,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:02,307 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.90625) internal successors, (61), 54 states have internal predecessors, (61), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:02,383 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-09 07:41:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:02,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:41:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:02,393 INFO L225 Difference]: With dead ends: 51 [2024-11-09 07:41:02,393 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 07:41:02,395 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 07:41:02,401 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:02,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 07:41:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 07:41:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 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 07:41:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-09 07:41:02,438 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 4 [2024-11-09 07:41:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-09 07:41:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-09 07:41:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:02,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:02,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:41:02,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-09 07:41:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537987847] [2024-11-09 07:41:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:02,628 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 07:41:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537987847] [2024-11-09 07:41:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537987847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832006050] [2024-11-09 07:41:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:02,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:02,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:02,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:02,633 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:02,718 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-11-09 07:41:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:41:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:02,721 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:41:02,723 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:41:02,723 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 07:41:02,724 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:02,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:41:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-09 07:41:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 states have internal predecessors, (56), 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 07:41:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-09 07:41:02,735 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 4 [2024-11-09 07:41:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:02,735 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-09 07:41:02,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-09 07:41:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:41:02,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:02,736 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:02,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:41:02,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:02,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash 719163786, now seen corresponding path program 1 times [2024-11-09 07:41:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342624245] [2024-11-09 07:41:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342624245] [2024-11-09 07:41:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342624245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048205469] [2024-11-09 07:41:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:02,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:02,946 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 07:41:02,948 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 07:41:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:03,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:41:03,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2024-11-09 07:41:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:03,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048205469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:03,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 07:41:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467000097] [2024-11-09 07:41:03,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:03,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:41:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:41:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:03,347 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 07:41:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:03,483 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-09 07:41:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:41:03,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 10 [2024-11-09 07:41:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:03,485 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:41:03,486 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:41:03,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:41:03,488 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:03,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:41:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 07:41:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.48) internal successors, (74), 68 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 07:41:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-09 07:41:03,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 10 [2024-11-09 07:41:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:03,501 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-09 07:41:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 07:41:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-09 07:41:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:41:03,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:03,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:03,522 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 07:41:03,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:03,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:03,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1824163901, now seen corresponding path program 1 times [2024-11-09 07:41:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586452390] [2024-11-09 07:41:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586452390] [2024-11-09 07:41:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586452390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89722687] [2024-11-09 07:41:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:03,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:03,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:03,845 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 07:41:03,847 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 07:41:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:03,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:41:03,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:03,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89722687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:04,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:04,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 07:41:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435075273] [2024-11-09 07:41:04,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:04,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:41:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:41:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:41:04,024 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 07:41:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:04,086 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-09 07:41:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:41:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:04,089 INFO L225 Difference]: With dead ends: 80 [2024-11-09 07:41:04,089 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 07:41:04,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:41:04,091 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:04,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 07:41:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 07:41:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 79 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 07:41:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 07:41:04,103 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 18 [2024-11-09 07:41:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 07:41:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 07:41:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 07:41:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:41:04,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:04,104 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1] [2024-11-09 07:41:04,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:41:04,308 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,SelfDestructingSolverStorable3 [2024-11-09 07:41:04,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1183242029, now seen corresponding path program 1 times [2024-11-09 07:41:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286536198] [2024-11-09 07:41:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 07:41:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286536198] [2024-11-09 07:41:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286536198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:04,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126087464] [2024-11-09 07:41:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:04,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:04,499 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:04,559 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-09 07:41:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:41:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:04,560 INFO L225 Difference]: With dead ends: 80 [2024-11-09 07:41:04,560 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 07:41:04,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:04,561 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:04,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 07:41:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-09 07:41:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 78 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 07:41:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-09 07:41:04,570 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 24 [2024-11-09 07:41:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-09 07:41:04,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-09 07:41:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:41:04,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:04,572 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-09 07:41:04,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:41:04,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1808870570, now seen corresponding path program 2 times [2024-11-09 07:41:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216485896] [2024-11-09 07:41:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216485896] [2024-11-09 07:41:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216485896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494338922] [2024-11-09 07:41:04,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:04,857 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 07:41:04,859 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 07:41:04,963 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:41:04,964 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:04,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:41:04,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:04,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2024-11-09 07:41:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:05,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494338922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-09 07:41:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377526514] [2024-11-09 07:41:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:41:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:41:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:41:05,231 INFO L87 Difference]: Start difference. First operand 79 states and 83 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 07:41:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:05,344 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-09 07:41:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:05,344 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 28 [2024-11-09 07:41:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:05,345 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:41:05,345 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:41:05,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:41:05,346 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:05,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:41:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 07:41:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 77 states have internal predecessors, (81), 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 07:41:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-09 07:41:05,353 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 28 [2024-11-09 07:41:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:05,353 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-09 07:41:05,353 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 07:41:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-09 07:41:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:41:05,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:05,357 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:05,375 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 07:41:05,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:05,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1373413197, now seen corresponding path program 2 times [2024-11-09 07:41:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614612329] [2024-11-09 07:41:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614612329] [2024-11-09 07:41:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614612329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115767482] [2024-11-09 07:41:05,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:05,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:05,735 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 07:41:05,736 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 07:41:05,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:41:05,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:05,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:41:05,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:05,846 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:41:05,846 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 21 treesize of output 13 [2024-11-09 07:41:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 07:41:05,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115767482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2024-11-09 07:41:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078559328] [2024-11-09 07:41:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:05,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:05,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:05,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:41:05,913 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:05,948 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-09 07:41:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:41:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:05,949 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:41:05,949 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:41:05,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:41:05,950 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:05,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:41:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 07:41:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.278688524590164) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-09 07:41:05,958 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 42 [2024-11-09 07:41:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-09 07:41:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-09 07:41:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:41:05,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:05,962 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:05,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:41:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:06,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1373413198, now seen corresponding path program 1 times [2024-11-09 07:41:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788261409] [2024-11-09 07:41:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788261409] [2024-11-09 07:41:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788261409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739936953] [2024-11-09 07:41:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:06,318 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 07:41:06,319 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 07:41:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:06,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:41:06,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:06,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:06,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739936953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:06,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-09 07:41:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468785599] [2024-11-09 07:41:06,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:41:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:41:06,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:41:06,641 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:06,713 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2024-11-09 07:41:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:41:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:41:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:06,714 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:41:06,714 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:41:06,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:41:06,716 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:06,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 177 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:41:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:41:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.2) internal successors, (102), 98 states have internal predecessors, (102), 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 07:41:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2024-11-09 07:41:06,722 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 42 [2024-11-09 07:41:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:06,722 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2024-11-09 07:41:06,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2024-11-09 07:41:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:41:06,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:06,727 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:06,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:41:06,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:06,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:06,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 183404126, now seen corresponding path program 2 times [2024-11-09 07:41:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337285654] [2024-11-09 07:41:06,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-09 07:41:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337285654] [2024-11-09 07:41:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337285654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849278986] [2024-11-09 07:41:07,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:07,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:07,348 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 07:41:07,349 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 07:41:07,463 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:41:07,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:07,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:41:07,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:07,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2024-11-09 07:41:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:07,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-09 07:41:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:07,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:07,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849278986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:07,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:07,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 07:41:07,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447994980] [2024-11-09 07:41:07,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:07,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:07,696 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:07,723 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2024-11-09 07:41:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 07:41:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:07,725 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:41:07,725 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:41:07,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:07,726 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:07,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:41:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-09 07:41:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 95 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 07:41:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2024-11-09 07:41:07,731 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 66 [2024-11-09 07:41:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:07,732 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2024-11-09 07:41:07,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2024-11-09 07:41:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:41:07,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:07,733 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:07,754 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 07:41:07,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:07,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1390615231, now seen corresponding path program 1 times [2024-11-09 07:41:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596727856] [2024-11-09 07:41:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:08,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:08,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596727856] [2024-11-09 07:41:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596727856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575558535] [2024-11-09 07:41:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:08,332 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:08,372 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2024-11-09 07:41:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:41:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 07:41:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:08,373 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:41:08,373 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:41:08,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:08,374 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:08,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:41:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 07:41:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 92 states have internal predecessors, (94), 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 07:41:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2024-11-09 07:41:08,381 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 67 [2024-11-09 07:41:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:08,381 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2024-11-09 07:41:08,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2024-11-09 07:41:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 07:41:08,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:08,382 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:08,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:41:08,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1230672867, now seen corresponding path program 1 times [2024-11-09 07:41:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582835143] [2024-11-09 07:41:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-09 07:41:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582835143] [2024-11-09 07:41:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582835143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649572667] [2024-11-09 07:41:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:08,671 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:08,721 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2024-11-09 07:41:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:41:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 07:41:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:08,722 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:41:08,722 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:41:08,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:08,723 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:08,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:41:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:41:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 91 states have internal predecessors, (93), 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 07:41:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2024-11-09 07:41:08,728 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 70 [2024-11-09 07:41:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2024-11-09 07:41:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2024-11-09 07:41:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 07:41:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:08,730 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:08,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:41:08,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1230672868, now seen corresponding path program 1 times [2024-11-09 07:41:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004070815] [2024-11-09 07:41:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004070815] [2024-11-09 07:41:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004070815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:09,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:09,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:41:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470269003] [2024-11-09 07:41:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:09,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:41:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:41:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:09,308 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 07:41:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:09,427 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2024-11-09 07:41:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 70 [2024-11-09 07:41:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:09,429 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:41:09,429 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:41:09,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:41:09,429 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:09,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 87 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:41:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:41:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 89 states have internal predecessors, (91), 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 07:41:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2024-11-09 07:41:09,436 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 70 [2024-11-09 07:41:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:09,437 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2024-11-09 07:41:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 07:41:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2024-11-09 07:41:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 07:41:09,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:09,438 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:09,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:41:09,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:09,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash 811469289, now seen corresponding path program 1 times [2024-11-09 07:41:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849242515] [2024-11-09 07:41:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849242515] [2024-11-09 07:41:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849242515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:41:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426231254] [2024-11-09 07:41:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:09,609 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:09,653 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2024-11-09 07:41:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:09,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 07:41:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:09,654 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:41:09,655 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:41:09,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:41:09,655 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:09,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 91 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:41:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 07:41:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 88 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 07:41:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2024-11-09 07:41:09,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 74 [2024-11-09 07:41:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2024-11-09 07:41:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2024-11-09 07:41:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 07:41:09,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:09,665 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:09,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:41:09,665 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 811469290, now seen corresponding path program 1 times [2024-11-09 07:41:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025220264] [2024-11-09 07:41:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025220264] [2024-11-09 07:41:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025220264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:41:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618415976] [2024-11-09 07:41:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:10,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:41:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:41:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:41:10,345 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:10,519 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-09 07:41:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:41:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 07:41:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:10,520 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:41:10,520 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:41:10,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:41:10,521 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:10,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:41:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:41:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.072289156626506) internal successors, (89), 87 states have internal predecessors, (89), 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 07:41:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2024-11-09 07:41:10,527 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 74 [2024-11-09 07:41:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2024-11-09 07:41:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:41:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2024-11-09 07:41:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 07:41:10,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:10,528 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:10,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:41:10,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:10,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1889293581, now seen corresponding path program 1 times [2024-11-09 07:41:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110841057] [2024-11-09 07:41:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110841057] [2024-11-09 07:41:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110841057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988931222] [2024-11-09 07:41:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:10,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:10,724 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 07:41:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:10,757 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-09 07:41:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:41:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 77 [2024-11-09 07:41:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:10,758 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:41:10,758 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:41:10,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:10,759 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:10,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:41:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:41:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 86 states have internal predecessors, (88), 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 07:41:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-09 07:41:10,762 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2024-11-09 07:41:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:10,762 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-09 07:41:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 07:41:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-09 07:41:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 07:41:10,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:10,763 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:41:10,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1889293580, now seen corresponding path program 1 times [2024-11-09 07:41:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418844539] [2024-11-09 07:41:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418844539] [2024-11-09 07:41:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418844539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748160696] [2024-11-09 07:41:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:11,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:11,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:11,005 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 07:41:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:11,032 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-09 07:41:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:41:11,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 77 [2024-11-09 07:41:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:11,033 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:41:11,033 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:41:11,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:11,034 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:11,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:41:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:41:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 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 07:41:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-09 07:41:11,036 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 77 [2024-11-09 07:41:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:11,037 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-09 07:41:11,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 07:41:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-09 07:41:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 07:41:11,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:11,038 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:11,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:41:11,038 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:11,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1561441170, now seen corresponding path program 1 times [2024-11-09 07:41:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:11,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433949991] [2024-11-09 07:41:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433949991] [2024-11-09 07:41:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433949991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:11,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:11,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:41:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397939880] [2024-11-09 07:41:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:11,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:41:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:41:11,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:11,273 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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 07:41:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:11,324 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-09 07:41:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:11,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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 78 [2024-11-09 07:41:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:11,325 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:41:11,325 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:41:11,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:41:11,326 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:11,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:41:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-09 07:41:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 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 07:41:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2024-11-09 07:41:11,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2024-11-09 07:41:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:11,329 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2024-11-09 07:41:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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 07:41:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2024-11-09 07:41:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 07:41:11,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:11,330 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:41:11,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1561441171, now seen corresponding path program 1 times [2024-11-09 07:41:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695982069] [2024-11-09 07:41:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:12,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695982069] [2024-11-09 07:41:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695982069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:41:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948918709] [2024-11-09 07:41:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:12,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:41:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:41:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:41:12,136 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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 07:41:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:12,278 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-11-09 07:41:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:41:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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 78 [2024-11-09 07:41:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:12,279 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:41:12,279 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:41:12,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:41:12,280 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 94 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 07:41:12,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 94 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:41:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 07:41:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 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 07:41:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-11-09 07:41:12,283 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2024-11-09 07:41:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-11-09 07:41:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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 07:41:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-11-09 07:41:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 07:41:12,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:12,284 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:41:12,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1804522663, now seen corresponding path program 1 times [2024-11-09 07:41:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873819602] [2024-11-09 07:41:12,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873819602] [2024-11-09 07:41:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873819602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605141274] [2024-11-09 07:41:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:18,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:18,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:18,658 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 07:41:18,659 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 07:41:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:18,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:41:18,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:19,542 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 07:41:19,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:19,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:19,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:19,900 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 43 treesize of output 12 [2024-11-09 07:41:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:41:19,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:20,143 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-09 07:41:20,144 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 18 treesize of output 18 [2024-11-09 07:41:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605141274] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:41:20,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [23, 18] total 47 [2024-11-09 07:41:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949849425] [2024-11-09 07:41:20,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:20,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:41:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:41:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:41:20,324 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 10 states, 10 states have (on average 2.9) 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 07:41:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:20,471 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-09 07:41:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:41:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) 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 83 [2024-11-09 07:41:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:20,472 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:41:20,472 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:41:20,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=198, Invalid=2252, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:41:20,474 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:20,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:41:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:41:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 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 07:41:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-09 07:41:20,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2024-11-09 07:41:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-09 07:41:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) 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 07:41:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-09 07:41:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:41:20,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:20,481 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:20,500 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 07:41:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:20,682 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -204017120, now seen corresponding path program 1 times [2024-11-09 07:41:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395053933] [2024-11-09 07:41:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 07:41:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395053933] [2024-11-09 07:41:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395053933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751148918] [2024-11-09 07:41:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:25,962 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 07:41:25,964 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 07:41:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:26,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:41:26,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:26,799 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 07:41:26,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:27,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:27,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:27,197 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 43 treesize of output 12 [2024-11-09 07:41:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:41:27,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:27,457 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-09 07:41:27,457 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 18 treesize of output 18 [2024-11-09 07:41:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 07:41:27,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751148918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:27,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 11] total 53 [2024-11-09 07:41:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97895999] [2024-11-09 07:41:27,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:27,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 07:41:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 07:41:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2567, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 07:41:27,623 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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 07:41:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:29,074 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2024-11-09 07:41:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 07:41:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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 85 [2024-11-09 07:41:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:29,075 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:41:29,075 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:41:29,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=363, Invalid=4059, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 07:41:29,077 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:29,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 884 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:41:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:41:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:41:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 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 07:41:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2024-11-09 07:41:29,080 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 85 [2024-11-09 07:41:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:29,080 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2024-11-09 07:41:29,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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 07:41:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2024-11-09 07:41:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:41:29,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:29,082 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:29,100 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 07:41:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:29,287 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2024-11-09 07:41:29,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash -681671691, now seen corresponding path program 2 times [2024-11-09 07:41:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966531263] [2024-11-09 07:41:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 90 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966531263] [2024-11-09 07:41:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966531263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626142639] [2024-11-09 07:41:34,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:34,880 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 07:41:34,881 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 07:41:35,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:41:35,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:35,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 07:41:35,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:35,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:41:35,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:41:35,929 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:35,930 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 25 treesize of output 17 [2024-11-09 07:41:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:35,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:35,938 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 21 treesize of output 16 [2024-11-09 07:41:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 07:41:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 7 proven. 283 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:41:36,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:36,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:36,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 104 [2024-11-09 07:41:42,928 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 22 [2024-11-09 07:41:42,937 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:41:42,938 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 59 treesize of output 52 [2024-11-09 07:41:42,950 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:42,953 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 22 [2024-11-09 07:41:42,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:42,958 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:42,961 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 22 [2024-11-09 07:41:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:42,967 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 22 [2024-11-09 07:41:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:42,973 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 22 [2024-11-09 07:41:42,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:42,979 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:42,982 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 46 treesize of output 42 [2024-11-09 07:41:42,986 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 33 treesize of output 31 [2024-11-09 07:41:42,992 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:41:42,992 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 50 treesize of output 1 [2024-11-09 07:41:42,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-11-09 07:41:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:43,001 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 35 treesize of output 33 [2024-11-09 07:41:43,006 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 44 treesize of output 40 [2024-11-09 07:41:43,011 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:41:43,011 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 50 treesize of output 1 [2024-11-09 07:41:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 07:41:43,017 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,019 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,025 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 22 [2024-11-09 07:41:43,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:43,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-11-09 07:41:43,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:43,042 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,045 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,048 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,051 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 07:41:43,057 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 07:41:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-11-09 07:41:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626142639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:43,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 15] total 64 [2024-11-09 07:41:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729394073] [2024-11-09 07:41:43,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-09 07:41:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-09 07:41:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3777, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 07:41:43,474 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 64 states, 64 states have (on average 3.03125) internal successors, (194), 64 states have internal predecessors, (194), 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 07:41:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:45,483 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2024-11-09 07:41:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 07:41:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.03125) internal successors, (194), 64 states have internal predecessors, (194), 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 91 [2024-11-09 07:41:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:45,485 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:41:45,485 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:41:45,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 143 SyntacticMatches, 10 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=505, Invalid=6635, Unknown=0, NotChecked=0, Total=7140 [2024-11-09 07:41:45,487 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:45,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 833 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:41:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:41:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:41:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 07:41:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:41:45,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-11-09 07:41:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:45,489 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:41:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.03125) internal successors, (194), 64 states have internal predecessors, (194), 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 07:41:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:41:45,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:41:45,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2024-11-09 07:41:45,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2024-11-09 07:41:45,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (1 of 22 remaining) [2024-11-09 07:41:45,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2024-11-09 07:41:45,512 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 07:41:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:45,700 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:45,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:41:45,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:41:45 BoogieIcfgContainer [2024-11-09 07:41:45,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:41:45,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:41:45,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:41:45,705 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:41:45,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:01" (3/4) ... [2024-11-09 07:41:45,709 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:41:45,718 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 07:41:45,719 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-09 07:41:45,719 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:41:45,719 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:41:45,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:41:45,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:41:45,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:41:45,809 INFO L158 Benchmark]: Toolchain (without parser) took 44887.16ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 113.6MB in the beginning and 1.1GB in the end (delta: -948.1MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,810 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:41:45,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.47ms. Allocated memory is still 151.0MB. Free memory was 113.6MB in the beginning and 100.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.54ms. Allocated memory is still 151.0MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,810 INFO L158 Benchmark]: Boogie Preprocessor took 75.90ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,810 INFO L158 Benchmark]: RCFGBuilder took 560.61ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 114.8MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,811 INFO L158 Benchmark]: TraceAbstraction took 43813.44ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 114.0MB in the beginning and 1.1GB in the end (delta: -952.9MB). Peak memory consumption was 179.7MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,811 INFO L158 Benchmark]: Witness Printer took 104.32ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:41:45,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.47ms. Allocated memory is still 151.0MB. Free memory was 113.6MB in the beginning and 100.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.54ms. Allocated memory is still 151.0MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.90ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 560.61ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 114.8MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43813.44ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 114.0MB in the beginning and 1.1GB in the end (delta: -952.9MB). Peak memory consumption was 179.7MB. Max. memory is 16.1GB. * Witness Printer took 104.32ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 43.8s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 3449 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2805 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4773 IncrementalHoareTripleChecker+Invalid, 4796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 644 mSDtfsCounter, 4773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 701 SyntacticMatches, 14 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=8, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 33.6s InterpolantComputationTime, 1627 NumberOfCodeBlocks, 1531 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1920 ConstructedInterpolants, 19 QuantifiedInterpolants, 24578 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2519 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 4244/6294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:41:45,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE