./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/strcspn.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 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:35:58,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:35:58,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:35:58,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:35:58,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:35:58,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:35:58,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:35:58,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:35:58,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:35:58,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:35:58,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:35:58,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:35:58,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:35:58,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:35:58,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:35:58,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:35:58,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:35:58,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:35:58,272 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:35:58,272 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:35:58,272 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:35:58,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:35:58,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:35:58,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:35:58,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:35:58,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:35:58,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:35:58,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:35:58,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:35:58,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:35:58,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:35:58,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:35:58,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:35:58,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:35:58,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:35:58,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:35:58,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:35:58,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:35:58,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:35:58,282 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 -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2024-11-09 07:35:58,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:35:58,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:35:58,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:35:58,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:35:58,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:35:58,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-09 07:36:00,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:36:00,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:36:00,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-09 07:36:00,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e16a9d8e/b6f9940667cc4ac484b030899d25a4fb/FLAGddd17f8eb [2024-11-09 07:36:00,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e16a9d8e/b6f9940667cc4ac484b030899d25a4fb [2024-11-09 07:36:00,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:36:00,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:36:00,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:00,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:36:00,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:36:00,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:00" (1/1) ... [2024-11-09 07:36:00,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746ce0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:00, skipping insertion in model container [2024-11-09 07:36:00,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:00" (1/1) ... [2024-11-09 07:36:00,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:36:00,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:00,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:36:01,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:01,042 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:36:01,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01 WrapperNode [2024-11-09 07:36:01,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:01,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:01,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:36:01,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:36:01,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,092 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-09 07:36:01,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:01,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:36:01,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:36:01,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:36:01,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,127 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-09 07:36:01,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:36:01,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:36:01,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:36:01,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:36:01,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (1/1) ... [2024-11-09 07:36:01,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:01,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:01,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:36:01,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:36:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:36:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:36:01,312 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:36:01,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:36:01,504 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 07:36:01,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:36:01,521 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:36:01,522 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:36:01,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:01 BoogieIcfgContainer [2024-11-09 07:36:01,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:36:01,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:36:01,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:36:01,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:36:01,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:00" (1/3) ... [2024-11-09 07:36:01,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af47058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:01, skipping insertion in model container [2024-11-09 07:36:01,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:01" (2/3) ... [2024-11-09 07:36:01,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af47058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:01, skipping insertion in model container [2024-11-09 07:36:01,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:01" (3/3) ... [2024-11-09 07:36:01,529 INFO L112 eAbstractionObserver]: Analyzing ICFG strcspn.i [2024-11-09 07:36:01,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:36:01,544 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 07:36:01,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:36:01,589 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;@7d8ad708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:36:01,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 07:36:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:01,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:01,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:01,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:01,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 925667, now seen corresponding path program 1 times [2024-11-09 07:36:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847826791] [2024-11-09 07:36:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:01,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847826791] [2024-11-09 07:36:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847826791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955789333] [2024-11-09 07:36:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:01,803 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:01,881 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-09 07:36:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:36:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:01,892 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:36:01,892 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:36:01,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:01,897 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:01,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:36:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 07:36:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 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-11-09 07:36:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-09 07:36:01,977 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-09 07:36:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:01,977 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-09 07:36:01,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-09 07:36:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:01,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:01,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:36:01,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-09 07:36:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413234260] [2024-11-09 07:36:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413234260] [2024-11-09 07:36:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413234260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718367075] [2024-11-09 07:36:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:02,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:02,101 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:02,151 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-09 07:36:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:36:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:02,154 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:36:02,154 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 07:36:02,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:02,156 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:02,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 07:36:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 07:36:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-09 07:36:02,166 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2024-11-09 07:36:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-09 07:36:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-09 07:36:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:02,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:02,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:36:02,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-09 07:36:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874347919] [2024-11-09 07:36:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874347919] [2024-11-09 07:36:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874347919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596025577] [2024-11-09 07:36:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:02,458 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:02,507 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-09 07:36:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:36:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:02,509 INFO L225 Difference]: With dead ends: 32 [2024-11-09 07:36:02,509 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:36:02,509 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-11-09 07:36:02,512 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 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-11-09 07:36:02,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:36:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 07:36:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-09 07:36:02,523 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 4 [2024-11-09 07:36:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-09 07:36:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-09 07:36:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:36:02,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:02,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:36:02,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2024-11-09 07:36:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597779206] [2024-11-09 07:36:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597779206] [2024-11-09 07:36:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597779206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:02,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016909642] [2024-11-09 07:36:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:02,620 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:02,649 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-09 07:36:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:36:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:02,650 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:36:02,651 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:36:02,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:02,652 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:02,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:36:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 07:36:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.619047619047619) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-09 07:36:02,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2024-11-09 07:36:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:02,664 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-09 07:36:02,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-09 07:36:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:36:02,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:02,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:36:02,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2024-11-09 07:36:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882665820] [2024-11-09 07:36:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882665820] [2024-11-09 07:36:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882665820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568937726] [2024-11-09 07:36:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:02,861 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:02,881 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-09 07:36:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:36:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:02,883 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:36:02,883 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:36:02,883 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-11-09 07:36:02,884 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:02,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:36:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 07:36:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-09 07:36:02,892 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2024-11-09 07:36:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:02,894 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-09 07:36:02,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-09 07:36:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:36:02,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:02,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:02,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:36:02,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:02,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782686, now seen corresponding path program 1 times [2024-11-09 07:36:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064629537] [2024-11-09 07:36:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064629537] [2024-11-09 07:36:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064629537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725102089] [2024-11-09 07:36:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,012 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:03,057 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 07:36:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:36:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:03,058 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:36:03,060 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:36:03,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,061 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:03,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:36:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 07:36:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 07:36:03,069 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 7 [2024-11-09 07:36:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:03,069 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 07:36:03,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 07:36:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:36:03,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:03,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:03,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:36:03,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:03,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383917, now seen corresponding path program 1 times [2024-11-09 07:36:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981916367] [2024-11-09 07:36:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:03,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-11-09 07:36:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981916367] [2024-11-09 07:36:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981916367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:03,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780769509] [2024-11-09 07:36:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:03,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,211 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:03,261 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-09 07:36:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:36:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:03,262 INFO L225 Difference]: With dead ends: 28 [2024-11-09 07:36:03,262 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 07:36:03,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,264 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:03,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 07:36:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 07:36:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-09 07:36:03,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 9 [2024-11-09 07:36:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:03,273 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-09 07:36:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 07:36:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:36:03,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:03,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:03,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:36:03,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2024-11-09 07:36:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436525696] [2024-11-09 07:36:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:03,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436525696] [2024-11-09 07:36:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436525696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:03,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:03,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:36:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448761071] [2024-11-09 07:36:03,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:03,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:03,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:03,544 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:03,627 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-09 07:36:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:36:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:36:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:03,628 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:36:03,628 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:36:03,628 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-11-09 07:36:03,629 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:03,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:36:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-11-09 07:36:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 35 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-11-09 07:36:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-09 07:36:03,640 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2024-11-09 07:36:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-09 07:36:03,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-09 07:36:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:36:03,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:03,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:36:03,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:03,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618095, now seen corresponding path program 1 times [2024-11-09 07:36:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937610226] [2024-11-09 07:36:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937610226] [2024-11-09 07:36:03,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937610226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:03,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:03,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041274091] [2024-11-09 07:36:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:03,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,714 INFO L87 Difference]: Start difference. First operand 36 states and 45 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-11-09 07:36:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:03,746 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-09 07:36:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:03,747 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-11-09 07:36:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:03,750 INFO L225 Difference]: With dead ends: 34 [2024-11-09 07:36:03,750 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:36:03,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:03,751 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:03,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:36:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 07:36:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 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-11-09 07:36:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-09 07:36:03,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2024-11-09 07:36:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:03,758 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-09 07:36:03,758 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-11-09 07:36:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-09 07:36:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:36:03,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:03,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:03,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:36:03,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:03,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618094, now seen corresponding path program 1 times [2024-11-09 07:36:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:03,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42474758] [2024-11-09 07:36:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42474758] [2024-11-09 07:36:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42474758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:36:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135417829] [2024-11-09 07:36:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:03,952 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-11-09 07:36:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:04,008 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-09 07:36:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:36:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-11-09 07:36:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:04,009 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:36:04,009 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 07:36:04,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:04,010 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:04,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 07:36:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2024-11-09 07:36:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-09 07:36:04,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 11 [2024-11-09 07:36:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-09 07:36:04,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-11-09 07:36:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-09 07:36:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:36:04,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:04,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:04,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:36:04,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:04,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash 698109586, now seen corresponding path program 1 times [2024-11-09 07:36:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:04,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114639330] [2024-11-09 07:36:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114639330] [2024-11-09 07:36:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114639330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:36:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419895630] [2024-11-09 07:36:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:04,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:04,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:04,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:04,201 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:04,234 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-09 07:36:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:36:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:36:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:04,237 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:36:04,237 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 07:36:04,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-09 07:36:04,238 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:04,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 07:36:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 07:36:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) 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-11-09 07:36:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-09 07:36:04,245 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2024-11-09 07:36:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:04,246 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 07:36:04,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-09 07:36:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:36:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:04,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:04,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:36:04,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 897154592, now seen corresponding path program 1 times [2024-11-09 07:36:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150146539] [2024-11-09 07:36:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:04,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:04,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150146539] [2024-11-09 07:36:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150146539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847839053] [2024-11-09 07:36:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:04,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:04,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:04,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:04,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:36:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:04,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:36:04,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:04,837 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-11-09 07:36:04,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:36:04,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:36:04,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:36:04,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:36:05,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:05,072 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-11-09 07:36:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:05,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:05,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:36:05,547 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-11-09 07:36:05,555 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:36:05,556 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-11-09 07:36:05,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:36:05,569 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-11-09 07:36:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847839053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:05,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-09 07:36:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977473025] [2024-11-09 07:36:05,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:36:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:36:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:36:05,586 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:05,898 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-09 07:36:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:36:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:36:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:05,899 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:36:05,899 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:36:05,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:36:05,900 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 80 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:05,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:36:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:36:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2024-11-09 07:36:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 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-11-09 07:36:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-09 07:36:05,903 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-09 07:36:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:05,904 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-09 07:36:05,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-09 07:36:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:36:05,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:05,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:05,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:36:06,108 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,SelfDestructingSolverStorable11 [2024-11-09 07:36:06,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1080800794, now seen corresponding path program 1 times [2024-11-09 07:36:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767738814] [2024-11-09 07:36:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767738814] [2024-11-09 07:36:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767738814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539047987] [2024-11-09 07:36:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:06,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:36:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:06,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:36:06,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:06,545 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-11-09 07:36:06,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:06,690 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 15 [2024-11-09 07:36:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:06,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:36:07,016 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 14 treesize of output 12 [2024-11-09 07:36:07,020 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 21 treesize of output 17 [2024-11-09 07:36:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539047987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-09 07:36:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029143353] [2024-11-09 07:36:07,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:07,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:36:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:07,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:36:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:36:07,078 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 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-11-09 07:36:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:07,465 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-09 07:36:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:36:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 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) Word has length 17 [2024-11-09 07:36:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:07,466 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:36:07,466 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:36:07,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:36:07,467 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:07,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:36:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:36:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2024-11-09 07:36:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-09 07:36:07,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 17 [2024-11-09 07:36:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-09 07:36:07,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 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-11-09 07:36:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-09 07:36:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:36:07,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:07,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:07,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:36:07,677 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,SelfDestructingSolverStorable12 [2024-11-09 07:36:07,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:07,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash 834958674, now seen corresponding path program 2 times [2024-11-09 07:36:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146675411] [2024-11-09 07:36:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146675411] [2024-11-09 07:36:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146675411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232397803] [2024-11-09 07:36:08,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:36:08,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:08,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:08,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:08,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:36:08,234 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:36:08,235 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:36:08,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 07:36:08,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:08,264 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-11-09 07:36:08,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:36:08,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:36:08,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:36:08,977 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-09 07:36:08,978 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 28 treesize of output 23 [2024-11-09 07:36:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:09,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:09,540 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-11-09 07:36:09,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:09,547 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 29 treesize of output 23 [2024-11-09 07:36:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-09 07:36:09,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:09,574 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-11-09 07:36:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:09,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232397803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:09,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:09,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-09 07:36:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57450121] [2024-11-09 07:36:09,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:36:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:09,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:36:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=661, Unknown=1, NotChecked=0, Total=756 [2024-11-09 07:36:09,660 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:14,424 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-09 07:36:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:36:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:36:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:14,427 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:36:14,427 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:36:14,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=199, Invalid=1279, Unknown=4, NotChecked=0, Total=1482 [2024-11-09 07:36:14,428 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 142 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:14,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 301 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 473 Invalid, 13 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 07:36:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:36:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2024-11-09 07:36:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-09 07:36:14,434 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 21 [2024-11-09 07:36:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:14,434 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-09 07:36:14,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-09 07:36:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:36:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:14,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:14,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:36:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:14,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -828013958, now seen corresponding path program 2 times [2024-11-09 07:36:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695622346] [2024-11-09 07:36:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:15,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:15,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695622346] [2024-11-09 07:36:15,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695622346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:15,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481489439] [2024-11-09 07:36:15,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:36:15,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:15,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:15,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:36:15,148 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:36:15,148 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:36:15,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:36:15,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:15,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:36:15,178 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-11-09 07:36:15,645 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:36:15,645 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 29 treesize of output 20 [2024-11-09 07:36:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:15,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:16,108 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-11-09 07:36:16,114 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-11-09 07:36:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481489439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:16,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2024-11-09 07:36:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060408880] [2024-11-09 07:36:16,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:16,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:36:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:36:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:36:16,164 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:17,274 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2024-11-09 07:36:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:36:17,275 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:36:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:17,276 INFO L225 Difference]: With dead ends: 275 [2024-11-09 07:36:17,276 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 07:36:17,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:36:17,277 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 266 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:17,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 221 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:36:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 07:36:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-11-09 07:36:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 171 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2024-11-09 07:36:17,287 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 23 [2024-11-09 07:36:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:17,287 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2024-11-09 07:36:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2024-11-09 07:36:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:36:17,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:17,289 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:17,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:36:17,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:36:17,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1529251018, now seen corresponding path program 3 times [2024-11-09 07:36:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040265856] [2024-11-09 07:36:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:18,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040265856] [2024-11-09 07:36:18,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040265856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:18,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580653932] [2024-11-09 07:36:18,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:36:18,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:18,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:18,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:18,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:36:18,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 07:36:18,145 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:36:18,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:36:18,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:18,171 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-11-09 07:36:18,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:36:18,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:36:18,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:36:18,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:36:18,955 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-09 07:36:18,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-09 07:36:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:36:19,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:20,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-09 07:36:20,372 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:36:20,375 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-11-09 07:36:20,382 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:36:20,383 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-11-09 07:36:20,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 125 [2024-11-09 07:36:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:20,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580653932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:20,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:20,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 37 [2024-11-09 07:36:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330421113] [2024-11-09 07:36:20,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:20,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:36:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:36:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:36:20,517 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,582 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2024-11-09 07:36:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:36:21,583 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:36:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,583 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:36:21,584 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 07:36:21,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=451, Invalid=2519, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 07:36:21,585 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 176 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 393 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:36:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 07:36:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 50. [2024-11-09 07:36:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-09 07:36:21,589 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2024-11-09 07:36:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,590 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-09 07:36:21,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-09 07:36:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:36:21,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,591 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:36:21,792 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,SelfDestructingSolverStorable15 [2024-11-09 07:36:21,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-09 07:36:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 41398838, now seen corresponding path program 3 times [2024-11-09 07:36:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258215195] [2024-11-09 07:36:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258215195] [2024-11-09 07:36:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258215195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:36:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507464175] [2024-11-09 07:36:22,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:36:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:36:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:22,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:36:22,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:36:22,517 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:36:22,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:36:22,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:36:22,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:22,526 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 7 [2024-11-09 07:36:22,566 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 18 treesize of output 14 [2024-11-09 07:36:23,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:36:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:36:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 07:36:23,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:36:23,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-09 07:36:23,500 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 26 treesize of output 20 [2024-11-09 07:36:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 07:36:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507464175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:36:23,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:36:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-11-09 07:36:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992934962] [2024-11-09 07:36:23,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:36:23,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 07:36:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 07:36:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:36:23,548 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:24,669 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-09 07:36:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:36:24,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 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 41 [2024-11-09 07:36:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:24,670 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:36:24,670 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:36:24,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 07:36:24,671 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:24,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:36:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:36:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:36:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:36:24,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-09 07:36:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:24,672 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:36:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:36:24,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:36:24,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2024-11-09 07:36:24,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2024-11-09 07:36:24,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2024-11-09 07:36:24,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2024-11-09 07:36:24,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2024-11-09 07:36:24,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2024-11-09 07:36:24,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2024-11-09 07:36:24,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:36:24,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:36:24,880 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:24,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:36:24,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:24 BoogieIcfgContainer [2024-11-09 07:36:24,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:36:24,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:36:24,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:36:24,886 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:36:24,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:01" (3/4) ... [2024-11-09 07:36:24,890 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:36:24,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:36:24,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:36:24,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:36:24,900 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:36:24,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:36:24,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:36:24,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:36:24,985 INFO L158 Benchmark]: Toolchain (without parser) took 24480.13ms. Allocated memory was 163.6MB in the beginning and 287.3MB in the end (delta: 123.7MB). Free memory was 91.3MB in the beginning and 218.2MB in the end (delta: -127.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:24,985 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:24,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.40ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 123.1MB in the end (delta: -32.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.99ms. Allocated memory is still 163.6MB. Free memory was 123.1MB in the beginning and 121.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,986 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 163.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,988 INFO L158 Benchmark]: RCFGBuilder took 365.83ms. Allocated memory is still 163.6MB. Free memory was 119.1MB in the beginning and 104.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,988 INFO L158 Benchmark]: TraceAbstraction took 23360.99ms. Allocated memory was 163.6MB in the beginning and 287.3MB in the end (delta: 123.7MB). Free memory was 103.4MB in the beginning and 223.1MB in the end (delta: -119.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,989 INFO L158 Benchmark]: Witness Printer took 98.77ms. Allocated memory is still 287.3MB. Free memory was 223.1MB in the beginning and 218.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:36:24,990 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.24ms. Allocated memory is still 113.2MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.40ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 123.1MB in the end (delta: -32.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.99ms. Allocated memory is still 163.6MB. Free memory was 123.1MB in the beginning and 121.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 163.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.83ms. Allocated memory is still 163.6MB. Free memory was 119.1MB in the beginning and 104.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23360.99ms. Allocated memory was 163.6MB in the beginning and 287.3MB in the end (delta: 123.7MB). Free memory was 103.4MB in the beginning and 223.1MB in the end (delta: -119.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 98.77ms. Allocated memory is still 287.3MB. Free memory was 223.1MB in the beginning and 218.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 517]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 2121 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1695 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3026 IncrementalHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 426 mSDtfsCounter, 3026 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 199 SyntacticMatches, 6 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=15, InterpolantAutomatonStates: 144, 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, 17 MinimizatonAttempts, 357 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 386 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 507 ConstructedInterpolants, 112 QuantifiedInterpolants, 9215 SizeOfPredicates, 40 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 101/369 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:36:25,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE