./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:08:32,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:08:32,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 16:08:32,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:08:32,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:08:32,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:08:32,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:08:32,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:08:32,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:08:32,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:08:32,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:08:32,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:08:32,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:08:32,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:08:32,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:08:32,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:08:32,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:08:32,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:08:32,807 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:08:32,807 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:08:32,807 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:08:32,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:08:32,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:08:32,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:08:32,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:08:32,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:08:32,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:08:32,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:08:32,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:08:32,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:08:32,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:08:32,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:08:32,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:08:32,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:08:32,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:08:32,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:08:32,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:08:32,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:08:32,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:08:32,813 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 [2024-10-24 16:08:33,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:08:33,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:08:33,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:08:33,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:08:33,096 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:08:33,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i [2024-10-24 16:08:34,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:08:34,800 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:08:34,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i [2024-10-24 16:08:34,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bced270d1/0dd7da4876db4f64bae8f7fce90f5ccf/FLAG01cdadd9e [2024-10-24 16:08:34,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bced270d1/0dd7da4876db4f64bae8f7fce90f5ccf [2024-10-24 16:08:34,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:08:34,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:08:34,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:08:34,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:08:34,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:08:34,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:08:34" (1/1) ... [2024-10-24 16:08:34,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1420d5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:34, skipping insertion in model container [2024-10-24 16:08:34,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:08:34" (1/1) ... [2024-10-24 16:08:34,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:08:35,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:08:35,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:08:35,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:08:35,290 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:08:35,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35 WrapperNode [2024-10-24 16:08:35,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:08:35,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:08:35,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:08:35,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:08:35,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,339 INFO L138 Inliner]: procedures = 114, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-10-24 16:08:35,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:08:35,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:08:35,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:08:35,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:08:35,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,374 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-10-24 16:08:35,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:08:35,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:08:35,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:08:35,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:08:35,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (1/1) ... [2024-10-24 16:08:35,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:08:35,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:08:35,427 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-10-24 16:08:35,432 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-10-24 16:08:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:08:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:08:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:08:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:08:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:08:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:08:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:08:35,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:08:35,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:08:35,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:08:35,933 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-24 16:08:35,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:08:35,969 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:08:35,969 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 16:08:35,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:08:35 BoogieIcfgContainer [2024-10-24 16:08:35,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:08:35,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:08:35,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:08:35,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:08:35,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:08:34" (1/3) ... [2024-10-24 16:08:35,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e065d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:08:35, skipping insertion in model container [2024-10-24 16:08:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:08:35" (2/3) ... [2024-10-24 16:08:35,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e065d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:08:35, skipping insertion in model container [2024-10-24 16:08:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:08:35" (3/3) ... [2024-10-24 16:08:35,978 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcat.i [2024-10-24 16:08:35,995 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:08:35,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-24 16:08:36,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:08:36,043 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;@9f2c8ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:08:36,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-24 16:08:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:08:36,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:36,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:08:36,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:36,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash 141531, now seen corresponding path program 1 times [2024-10-24 16:08:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258266110] [2024-10-24 16:08:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:36,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258266110] [2024-10-24 16:08:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258266110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:36,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:08:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582347433] [2024-10-24 16:08:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:08:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:08:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:36,247 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:36,308 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-24 16:08:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:08:36,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:08:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:36,318 INFO L225 Difference]: With dead ends: 43 [2024-10-24 16:08:36,319 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 16:08:36,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:36,327 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:36,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 16:08:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 16:08:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 2.0) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-24 16:08:36,363 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 3 [2024-10-24 16:08:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:36,363 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-24 16:08:36,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-24 16:08:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:08:36,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:36,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:08:36,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:08:36,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:36,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 141493, now seen corresponding path program 1 times [2024-10-24 16:08:36,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596913222] [2024-10-24 16:08:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596913222] [2024-10-24 16:08:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596913222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:36,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:36,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:08:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822216142] [2024-10-24 16:08:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:36,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:08:36,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:08:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:36,545 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:36,604 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-24 16:08:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:08:36,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:08:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:36,606 INFO L225 Difference]: With dead ends: 40 [2024-10-24 16:08:36,606 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 16:08:36,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:36,607 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:36,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:08:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 16:08:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 16:08:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-10-24 16:08:36,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 3 [2024-10-24 16:08:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:36,613 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-24 16:08:36,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-10-24 16:08:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:08:36,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:36,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:08:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:08:36,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:36,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 141494, now seen corresponding path program 1 times [2024-10-24 16:08:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:36,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728289035] [2024-10-24 16:08:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728289035] [2024-10-24 16:08:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728289035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:08:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247800815] [2024-10-24 16:08:36,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:08:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:36,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:08:36,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:36,834 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:36,891 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-24 16:08:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:08:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:36,893 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:08:36,893 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:08:36,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:36,894 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:36,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:08:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 16:08:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-24 16:08:36,904 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 3 [2024-10-24 16:08:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:36,906 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-24 16:08:36,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-24 16:08:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:08:36,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:36,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:08:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:08:36,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 136075231, now seen corresponding path program 1 times [2024-10-24 16:08:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617715730] [2024-10-24 16:08:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617715730] [2024-10-24 16:08:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617715730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:08:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580760435] [2024-10-24 16:08:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:08:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:36,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:08:36,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:36,988 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,032 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-24 16:08:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:08:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:08:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,033 INFO L225 Difference]: With dead ends: 38 [2024-10-24 16:08:37,033 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 16:08:37,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:37,035 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 16:08:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 16:08:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-24 16:08:37,039 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 5 [2024-10-24 16:08:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,040 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-24 16:08:37,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-24 16:08:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:08:37,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:08:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:08:37,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash 136075232, now seen corresponding path program 1 times [2024-10-24 16:08:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401152815] [2024-10-24 16:08:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401152815] [2024-10-24 16:08:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401152815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:08:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956163690] [2024-10-24 16:08:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:08:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:08:37,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:37,232 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,257 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-10-24 16:08:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:08:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,258 INFO L225 Difference]: With dead ends: 37 [2024-10-24 16:08:37,258 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:08:37,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:37,259 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:08:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 16:08:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-10-24 16:08:37,270 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 5 [2024-10-24 16:08:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,273 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-10-24 16:08:37,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-10-24 16:08:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:08:37,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:08:37,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:08:37,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:37,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash 136075260, now seen corresponding path program 1 times [2024-10-24 16:08:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776967947] [2024-10-24 16:08:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:37,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776967947] [2024-10-24 16:08:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776967947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:37,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:08:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505175287] [2024-10-24 16:08:37,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:37,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:08:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:08:37,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:37,380 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,431 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-24 16:08:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:08:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,432 INFO L225 Difference]: With dead ends: 38 [2024-10-24 16:08:37,434 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:08:37,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:37,435 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:08:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 16:08:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-24 16:08:37,443 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 5 [2024-10-24 16:08:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-24 16:08:37,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-24 16:08:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:08:37,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:08:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:08:37,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:37,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -76632040, now seen corresponding path program 1 times [2024-10-24 16:08:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035662417] [2024-10-24 16:08:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035662417] [2024-10-24 16:08:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035662417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:08:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959331530] [2024-10-24 16:08:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:37,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:08:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:08:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:08:37,549 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,610 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-24 16:08:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:37,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-24 16:08:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,612 INFO L225 Difference]: With dead ends: 36 [2024-10-24 16:08:37,613 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 16:08:37,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-24 16:08:37,614 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 40 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:08:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 16:08:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-24 16:08:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-24 16:08:37,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2024-10-24 16:08:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-24 16:08:37,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-24 16:08:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:08:37,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:08:37,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:08:37,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -76632039, now seen corresponding path program 1 times [2024-10-24 16:08:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256246621] [2024-10-24 16:08:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256246621] [2024-10-24 16:08:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256246621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:37,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:37,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:08:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823073205] [2024-10-24 16:08:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:37,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:08:37,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:08:37,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:08:37,873 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,972 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-10-24 16:08:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:08:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-24 16:08:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,974 INFO L225 Difference]: With dead ends: 55 [2024-10-24 16:08:37,974 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 16:08:37,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:08:37,975 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:08:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 16:08:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-10-24 16:08:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-24 16:08:37,981 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 6 [2024-10-24 16:08:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,981 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-24 16:08:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-24 16:08:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:08:37,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:37,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:08:37,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:37,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1980301344, now seen corresponding path program 1 times [2024-10-24 16:08:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121905499] [2024-10-24 16:08:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121905499] [2024-10-24 16:08:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121905499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:08:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051168576] [2024-10-24 16:08:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:38,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:08:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:38,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:08:38,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:38,012 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:38,032 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-10-24 16:08:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:08:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 16:08:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:38,033 INFO L225 Difference]: With dead ends: 47 [2024-10-24 16:08:38,033 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 16:08:38,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:38,034 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:38,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 16:08:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 16:08:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 46 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-10-24 16:08:38,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 9 [2024-10-24 16:08:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:38,039 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-10-24 16:08:38,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2024-10-24 16:08:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:08:38,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:38,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:38,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:08:38,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1980299422, now seen corresponding path program 1 times [2024-10-24 16:08:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041923296] [2024-10-24 16:08:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041923296] [2024-10-24 16:08:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041923296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:08:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370585409] [2024-10-24 16:08:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:08:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:08:38,395 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-10-24 16:08:38,397 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-10-24 16:08:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:38,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:08:38,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:38,565 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 14 treesize of output 10 [2024-10-24 16:08:38,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:08:38,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:08:38,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:08:38,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:08:38,801 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 32 treesize of output 29 [2024-10-24 16:08:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:38,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:08:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-24 16:08:39,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:08:39,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-24 16:08:39,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-24 16:08:39,231 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:08:39,232 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 13 treesize of output 12 [2024-10-24 16:08:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:39,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370585409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:08:39,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:08:39,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-10-24 16:08:39,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834187045] [2024-10-24 16:08:39,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:08:39,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:08:39,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:08:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:08:39,246 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 21 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-10-24 16:08:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:39,897 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2024-10-24 16:08:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:08:39,898 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.15) internal successors, (23), 21 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 9 [2024-10-24 16:08:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:39,900 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:08:39,900 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:08:39,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:08:39,903 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 179 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:39,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 510 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:08:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:08:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 53. [2024-10-24 16:08:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 52 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2024-10-24 16:08:39,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 9 [2024-10-24 16:08:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:39,913 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2024-10-24 16:08:39,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.15) internal successors, (23), 21 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-10-24 16:08:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2024-10-24 16:08:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:08:39,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:39,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:39,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:08:40,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 16:08:40,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 399037560, now seen corresponding path program 1 times [2024-10-24 16:08:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235466466] [2024-10-24 16:08:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235466466] [2024-10-24 16:08:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235466466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:40,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:08:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373433591] [2024-10-24 16:08:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:40,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:08:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:08:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:40,152 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:40,182 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2024-10-24 16:08:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:08:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-24 16:08:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:40,184 INFO L225 Difference]: With dead ends: 52 [2024-10-24 16:08:40,184 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 16:08:40,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:08:40,185 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 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.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:40,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 16:08:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-24 16:08:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 50 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-10-24 16:08:40,188 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 11 [2024-10-24 16:08:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-10-24 16:08:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-10-24 16:08:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:08:40,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:40,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:08:40,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:40,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 399037561, now seen corresponding path program 1 times [2024-10-24 16:08:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127777806] [2024-10-24 16:08:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:40,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127777806] [2024-10-24 16:08:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127777806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:40,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:40,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:08:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991736037] [2024-10-24 16:08:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:40,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:08:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:40,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:08:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:40,300 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:40,345 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2024-10-24 16:08:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-24 16:08:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:40,346 INFO L225 Difference]: With dead ends: 67 [2024-10-24 16:08:40,346 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 16:08:40,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:40,347 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:40,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 63 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 16:08:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-24 16:08:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.62) internal successors, (81), 58 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-10-24 16:08:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-10-24 16:08:40,354 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 11 [2024-10-24 16:08:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:40,354 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-10-24 16:08:40,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-10-24 16:08:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:08:40,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:40,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:40,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:08:40,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -514763295, now seen corresponding path program 1 times [2024-10-24 16:08:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563967380] [2024-10-24 16:08:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563967380] [2024-10-24 16:08:40,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563967380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:40,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:40,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:08:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083226554] [2024-10-24 16:08:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:40,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:08:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:08:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:40,410 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:40,453 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2024-10-24 16:08:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:08:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 16:08:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:40,454 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:08:40,454 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:08:40,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:08:40,455 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:40,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:08:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:08:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-24 16:08:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.6) internal successors, (80), 57 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-10-24 16:08:40,462 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 12 [2024-10-24 16:08:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:40,462 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-10-24 16:08:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-10-24 16:08:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:08:40,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:40,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:40,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:08:40,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -514763294, now seen corresponding path program 1 times [2024-10-24 16:08:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291028548] [2024-10-24 16:08:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:40,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291028548] [2024-10-24 16:08:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291028548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:08:40,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:08:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:08:40,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538992249] [2024-10-24 16:08:40,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:08:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:08:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:08:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:08:40,624 INFO L87 Difference]: Start difference. First operand 58 states and 80 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-10-24 16:08:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:40,681 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-10-24 16:08:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:08:40,682 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 12 [2024-10-24 16:08:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:40,683 INFO L225 Difference]: With dead ends: 70 [2024-10-24 16:08:40,683 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:08:40,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:08:40,684 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:40,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:08:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:08:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-10-24 16:08:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.588235294117647) internal successors, (81), 58 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-10-24 16:08:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-10-24 16:08:40,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 12 [2024-10-24 16:08:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-10-24 16:08:40,691 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-10-24 16:08:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-10-24 16:08:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:08:40,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:40,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:08:40,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:08:40,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -567925255, now seen corresponding path program 2 times [2024-10-24 16:08:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:08:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594136503] [2024-10-24 16:08:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:08:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:08:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594136503] [2024-10-24 16:08:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594136503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:08:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097051875] [2024-10-24 16:08:41,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:08:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:08:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:08:41,263 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-10-24 16:08:41,264 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-10-24 16:08:41,334 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:08:41,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:08:41,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 16:08:41,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:41,371 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 14 treesize of output 10 [2024-10-24 16:08:41,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:08:41,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:08:41,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:08:45,733 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-24 16:08:45,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2024-10-24 16:08:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:45,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:08:46,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-10-24 16:08:46,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:08:46,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-10-24 16:08:46,312 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 29 treesize of output 25 [2024-10-24 16:08:46,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-24 16:08:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:46,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097051875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:08:46,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:08:46,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-10-24 16:08:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799095542] [2024-10-24 16:08:46,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:08:46,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 16:08:46,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:08:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 16:08:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=659, Unknown=1, NotChecked=0, Total=756 [2024-10-24 16:08:46,369 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:50,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:08:55,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:08:59,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:05,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:09,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:14,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:18,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:31,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:35,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:40,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:44,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:09:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:45,981 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2024-10-24 16:09:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:09:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 16:09:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:45,982 INFO L225 Difference]: With dead ends: 271 [2024-10-24 16:09:45,983 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 16:09:45,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=319, Invalid=1743, Unknown=8, NotChecked=0, Total=2070 [2024-10-24 16:09:45,984 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 535 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 29 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:45,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1122 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1413 Invalid, 33 Unknown, 0 Unchecked, 50.7s Time] [2024-10-24 16:09:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 16:09:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 68. [2024-10-24 16:09:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.6) internal successors, (96), 67 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-24 16:09:45,990 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 12 [2024-10-24 16:09:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:45,991 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-24 16:09:45,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-24 16:09:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:09:45,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:45,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:46,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:09:46,196 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,SelfDestructingSolverStorable14 [2024-10-24 16:09:46,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:46,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -766330157, now seen corresponding path program 1 times [2024-10-24 16:09:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81857016] [2024-10-24 16:09:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81857016] [2024-10-24 16:09:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81857016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:09:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224697844] [2024-10-24 16:09:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:09:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:09:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:09:46,259 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:46,297 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2024-10-24 16:09:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:09:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:09:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:46,298 INFO L225 Difference]: With dead ends: 69 [2024-10-24 16:09:46,298 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 16:09:46,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:09:46,299 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:46,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 16:09:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-24 16:09:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 67 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-24 16:09:46,303 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 14 [2024-10-24 16:09:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-24 16:09:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-24 16:09:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:09:46,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:46,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:46,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:09:46,304 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -766284825, now seen corresponding path program 1 times [2024-10-24 16:09:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154212098] [2024-10-24 16:09:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:09:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154212098] [2024-10-24 16:09:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154212098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:09:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137526819] [2024-10-24 16:09:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:46,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:09:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:09:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:09:46,419 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:46,480 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2024-10-24 16:09:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:09:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:09:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:46,481 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:09:46,481 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:09:46,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:09:46,482 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:46,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:09:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2024-10-24 16:09:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 72 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-10-24 16:09:46,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 14 [2024-10-24 16:09:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:46,486 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-10-24 16:09:46,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-10-24 16:09:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:09:46,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:46,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:09:46,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1510816646, now seen corresponding path program 1 times [2024-10-24 16:09:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:46,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41202398] [2024-10-24 16:09:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41202398] [2024-10-24 16:09:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41202398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:46,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:09:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940757879] [2024-10-24 16:09:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:09:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:46,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:09:46,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:09:46,610 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:46,644 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2024-10-24 16:09:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:09:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:09:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:46,645 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:09:46,645 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 16:09:46,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:09:46,646 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:46,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 66 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 16:09:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 16:09:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 66 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-10-24 16:09:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-10-24 16:09:46,651 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 15 [2024-10-24 16:09:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:46,651 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-10-24 16:09:46,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-10-24 16:09:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:09:46,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:46,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:46,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:09:46,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:46,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1510775632, now seen corresponding path program 1 times [2024-10-24 16:09:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892457174] [2024-10-24 16:09:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:46,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:46,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892457174] [2024-10-24 16:09:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892457174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:46,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754781892] [2024-10-24 16:09:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:46,862 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-10-24 16:09:46,870 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-10-24 16:09:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:46,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:09:46,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:09:46,968 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 14 treesize of output 10 [2024-10-24 16:09:47,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:09:47,066 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 19 [2024-10-24 16:09:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:47,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:09:47,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-24 16:09:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-24 16:09:47,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-24 16:09:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:47,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754781892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:09:47,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:09:47,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-24 16:09:47,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374092530] [2024-10-24 16:09:47,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:09:47,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:09:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:47,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:09:47,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:09:47,307 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:47,506 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2024-10-24 16:09:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:09:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:09:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:47,507 INFO L225 Difference]: With dead ends: 93 [2024-10-24 16:09:47,507 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 16:09:47,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:09:47,508 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:47,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 85 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 16:09:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2024-10-24 16:09:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 73 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-10-24 16:09:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2024-10-24 16:09:47,510 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 15 [2024-10-24 16:09:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:47,511 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2024-10-24 16:09:47,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2024-10-24 16:09:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:09:47,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:47,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:47,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:09:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:47,712 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1510784578, now seen corresponding path program 1 times [2024-10-24 16:09:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240438517] [2024-10-24 16:09:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240438517] [2024-10-24 16:09:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240438517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:09:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071645487] [2024-10-24 16:09:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:09:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:47,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:09:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:09:47,751 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:47,789 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2024-10-24 16:09:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:09:47,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:09:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:47,790 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:09:47,790 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:09:47,790 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-10-24 16:09:47,791 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:47,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:09:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 16:09:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2024-10-24 16:09:47,793 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 15 [2024-10-24 16:09:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:47,794 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2024-10-24 16:09:47,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2024-10-24 16:09:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:09:47,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:47,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:47,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 16:09:47,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:47,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1510784577, now seen corresponding path program 1 times [2024-10-24 16:09:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:47,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516924038] [2024-10-24 16:09:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516924038] [2024-10-24 16:09:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516924038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:09:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47691672] [2024-10-24 16:09:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:47,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:09:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:09:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:09:47,892 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:47,968 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2024-10-24 16:09:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:09:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:09:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:47,969 INFO L225 Difference]: With dead ends: 100 [2024-10-24 16:09:47,969 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 16:09:47,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:09:47,970 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:47,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 16:09:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 16:09:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.351063829787234) internal successors, (127), 98 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2024-10-24 16:09:47,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 15 [2024-10-24 16:09:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:47,972 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2024-10-24 16:09:47,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2024-10-24 16:09:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:09:47,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:47,977 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:47,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 16:09:47,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:47,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1504927596, now seen corresponding path program 1 times [2024-10-24 16:09:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:47,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127074226] [2024-10-24 16:09:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:09:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127074226] [2024-10-24 16:09:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127074226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957381950] [2024-10-24 16:09:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:48,213 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-10-24 16:09:48,214 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-10-24 16:09:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:48,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:09:48,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:09:48,317 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 14 treesize of output 10 [2024-10-24 16:09:48,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:09:48,498 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 19 [2024-10-24 16:09:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:09:48,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:09:48,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-24 16:09:48,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-24 16:09:48,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-24 16:09:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:09:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957381950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:09:48,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:09:48,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-24 16:09:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473891272] [2024-10-24 16:09:48,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:09:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:09:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:09:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:09:48,810 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:49,026 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2024-10-24 16:09:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:09:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 16:09:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:49,030 INFO L225 Difference]: With dead ends: 103 [2024-10-24 16:09:49,030 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 16:09:49,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:09:49,030 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:49,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 16:09:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-24 16:09:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.34375) internal successors, (129), 100 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2024-10-24 16:09:49,035 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 17 [2024-10-24 16:09:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2024-10-24 16:09:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2024-10-24 16:09:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:09:49,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:49,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:49,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:09:49,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:49,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:49,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 177323738, now seen corresponding path program 1 times [2024-10-24 16:09:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734210802] [2024-10-24 16:09:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734210802] [2024-10-24 16:09:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734210802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925651044] [2024-10-24 16:09:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:49,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:49,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:49,348 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-10-24 16:09:49,350 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-10-24 16:09:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:49,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:09:49,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:09:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:49,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:09:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925651044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:49,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:09:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-24 16:09:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709422756] [2024-10-24 16:09:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:49,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:09:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:09:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:09:49,468 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:49,538 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2024-10-24 16:09:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:09:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:09:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:49,540 INFO L225 Difference]: With dead ends: 111 [2024-10-24 16:09:49,540 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 16:09:49,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:09:49,540 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:49,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 60 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 16:09:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2024-10-24 16:09:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 82 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2024-10-24 16:09:49,543 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 18 [2024-10-24 16:09:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:49,552 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2024-10-24 16:09:49,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2024-10-24 16:09:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:09:49,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:49,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:49,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:09:49,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 16:09:49,754 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:49,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash -10682009, now seen corresponding path program 2 times [2024-10-24 16:09:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:49,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463578136] [2024-10-24 16:09:49,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463578136] [2024-10-24 16:09:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463578136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967425647] [2024-10-24 16:09:50,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:09:50,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:50,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:50,075 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-10-24 16:09:50,077 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-10-24 16:09:50,151 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:09:50,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:09:50,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:09:50,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:09:50,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:09:50,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:09:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:50,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:09:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967425647] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:50,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:09:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 19 [2024-10-24 16:09:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283117417] [2024-10-24 16:09:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:09:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:09:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:09:50,516 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:50,687 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2024-10-24 16:09:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:09:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-24 16:09:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:50,688 INFO L225 Difference]: With dead ends: 105 [2024-10-24 16:09:50,688 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 16:09:50,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:09:50,689 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:50,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 16:09:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-10-24 16:09:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 96 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2024-10-24 16:09:50,691 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 19 [2024-10-24 16:09:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:50,691 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2024-10-24 16:09:50,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2024-10-24 16:09:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:09:50,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:50,692 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:50,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 16:09:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:50,897 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash 343690649, now seen corresponding path program 1 times [2024-10-24 16:09:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683331880] [2024-10-24 16:09:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:09:50,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:09:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:09:50,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 16:09:50,944 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:09:50,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-10-24 16:09:50,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-10-24 16:09:50,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-10-24 16:09:50,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-10-24 16:09:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:09:50,951 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:50,982 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:09:50,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:09:50 BoogieIcfgContainer [2024-10-24 16:09:50,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:09:50,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:09:50,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:09:50,985 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:09:50,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:08:35" (3/4) ... [2024-10-24 16:09:50,986 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 16:09:51,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:09:51,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:09:51,035 INFO L158 Benchmark]: Toolchain (without parser) took 76195.51ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 110.8MB in the beginning and 141.9MB in the end (delta: -31.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,035 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:09:51,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.83ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 90.5MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,035 INFO L158 Benchmark]: Boogie Preprocessor took 51.47ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,036 INFO L158 Benchmark]: RCFGBuilder took 577.59ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 66.1MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,036 INFO L158 Benchmark]: TraceAbstraction took 75012.60ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 65.3MB in the beginning and 144.0MB in the end (delta: -78.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:09:51,036 INFO L158 Benchmark]: Witness Printer took 49.38ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:51,037 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.18ms. Allocated memory is still 159.4MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.83ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 90.5MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.47ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.59ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 66.1MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 75012.60ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 65.3MB in the beginning and 144.0MB in the end (delta: -78.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 49.38ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L538] int in_len = __VERIFIER_nondet_int(); [L539] COND FALSE !(in_len < 1) [L540] char* in = __builtin_alloca (in_len); VAL [in={4:0}, in_len=1] [L541] in[in_len-1]=0 [L542] int out_len = __VERIFIER_nondet_int(); [L543] COND FALSE !(out_len < 1) [L544] char* out = __builtin_alloca (out_len); VAL [in={4:0}, out={3:0}, out_len=2] [L545] out[out_len-1]=0 [L546] CALL strlcat(in, out, out_len) [L517] register char *d = dst; [L518] register const char *s = src; [L519] register size_t n = siz; [L520] size_t dlen; VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] EXPR \read(*d) [L521] *d != '\0' && n-- != 0 VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] COND FALSE !(*d != '\0' && n-- != 0) [L523] dlen = d - dst [L524] n = siz - dlen VAL [d={4:0}, dlen=0, n=2, s={3:0}] [L525] COND FALSE !(n == 0) [L527] EXPR \read(*s) [L527] COND TRUE *s != '\0' [L528] COND TRUE n != 1 [L529] EXPR d++ VAL [d={4:1}, dlen=0, n=2, s={3:0}] [L529] EXPR \read(*s) [L529] *d++ = *s [L530] n-- VAL [d={4:1}, dlen=0, n=1, s={3:0}] [L532] s++ VAL [d={4:1}, dlen=0, n=1, s={3:1}] [L527] EXPR \read(*s) [L527] COND FALSE !(*s != '\0') [L534] *d = '\0' - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 74.9s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 1022 SdHoareTripleChecker+Valid, 52.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1022 mSDsluCounter, 3070 SdHoareTripleChecker+Invalid, 51.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2361 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3351 IncrementalHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 709 mSDtfsCounter, 3351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=22, InterpolantAutomatonStates: 142, 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, 24 MinimizatonAttempts, 377 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 381 ConstructedInterpolants, 36 QuantifiedInterpolants, 3890 SizeOfPredicates, 38 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 24/59 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-24 16:09:51,073 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)