./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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-memory-alloca/cstrcspn-alloca-2.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 f64b3fe201853945f195ec183c791419b294b96abed6f2b53814faca3533a624 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:20:33,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:20:33,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-17 00:20:33,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:20:33,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:20:33,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:20:33,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:20:33,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:20:33,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:20:33,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:20:33,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:20:33,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:20:33,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:20:33,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:20:33,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:20:33,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:20:33,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:20:33,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:20:33,988 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:20:33,988 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:20:33,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:20:33,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:20:33,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:20:33,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:20:33,994 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:20:33,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:20:33,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:20:33,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:20:33,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:20:33,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:20:33,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:20:33,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:20:33,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:20:33,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:20:33,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:20:33,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:20:33,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:20:33,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:20:33,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:20:33,999 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 -> f64b3fe201853945f195ec183c791419b294b96abed6f2b53814faca3533a624 [2024-11-17 00:20:34,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:20:34,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:20:34,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:20:34,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:20:34,274 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:20:34,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2024-11-17 00:20:35,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:20:35,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:20:35,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2024-11-17 00:20:36,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3acc927/0989f63d4ce849cfac5fc9d1bf2f04e2/FLAGf587d4149 [2024-11-17 00:20:36,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3acc927/0989f63d4ce849cfac5fc9d1bf2f04e2 [2024-11-17 00:20:36,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:20:36,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:20:36,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:20:36,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:20:36,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:20:36,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce852d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36, skipping insertion in model container [2024-11-17 00:20:36,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:20:36,388 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:20:36,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:20:36,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:20:36,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:20:36,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:20:36,482 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:20:36,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36 WrapperNode [2024-11-17 00:20:36,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:20:36,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:20:36,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:20:36,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:20:36,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,525 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-17 00:20:36,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:20:36,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:20:36,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:20:36,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:20:36,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,556 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 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-17 00:20:36,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:20:36,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:20:36,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:20:36,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:20:36,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (1/1) ... [2024-11-17 00:20:36,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:20:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:20:36,610 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-17 00:20:36,620 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-17 00:20:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:20:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:20:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:20:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:20:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:20:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:20:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:20:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:20:36,795 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:20:36,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:20:37,056 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2024-11-17 00:20:37,079 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-17 00:20:37,080 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:20:37,098 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:20:37,098 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:20:37,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:20:37 BoogieIcfgContainer [2024-11-17 00:20:37,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:20:37,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:20:37,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:20:37,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:20:37,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:20:36" (1/3) ... [2024-11-17 00:20:37,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ef5fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:20:37, skipping insertion in model container [2024-11-17 00:20:37,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:20:36" (2/3) ... [2024-11-17 00:20:37,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ef5fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:20:37, skipping insertion in model container [2024-11-17 00:20:37,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:20:37" (3/3) ... [2024-11-17 00:20:37,110 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-2.i [2024-11-17 00:20:37,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:20:37,129 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-17 00:20:37,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:20:37,181 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;@1eb3affa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:20:37,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-17 00:20:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:20:37,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:37,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:20:37,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1663057604, now seen corresponding path program 1 times [2024-11-17 00:20:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912492613] [2024-11-17 00:20:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:37,566 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-17 00:20:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912492613] [2024-11-17 00:20:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912492613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:37,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:20:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723919306] [2024-11-17 00:20:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:20:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:20:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:20:37,601 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:37,670 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-17 00:20:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:20:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:20:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:37,680 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:20:37,680 INFO L226 Difference]: Without dead ends: 40 [2024-11-17 00:20:37,682 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-17 00:20:37,687 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:37,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-17 00:20:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-17 00:20:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 39 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-17 00:20:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-17 00:20:37,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2024-11-17 00:20:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:37,724 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-17 00:20:37,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-17 00:20:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:20:37,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:37,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:20:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:20:37,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1663057603, now seen corresponding path program 1 times [2024-11-17 00:20:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468803561] [2024-11-17 00:20:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,059 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-17 00:20:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468803561] [2024-11-17 00:20:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468803561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:20:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442391692] [2024-11-17 00:20:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:20:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:20:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:20:38,067 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,133 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-17 00:20:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:20:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:20:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,135 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:20:38,136 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:20:38,137 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-17 00:20:38,139 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:38,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:20:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:20:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 00:20:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-17 00:20:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-17 00:20:38,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 6 [2024-11-17 00:20:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,148 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-17 00:20:38,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-17 00:20:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:20:38,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:20:38,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1663027812, now seen corresponding path program 1 times [2024-11-17 00:20:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824211804] [2024-11-17 00:20:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,380 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-17 00:20:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824211804] [2024-11-17 00:20:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824211804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:20:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563240920] [2024-11-17 00:20:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:20:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:20:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:20:38,383 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,402 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-17 00:20:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:20:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:20:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,405 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:20:38,406 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:20:38,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:20:38,408 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:38,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:20:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-17 00:20:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-17 00:20:38,415 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2024-11-17 00:20:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 00:20:38,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-17 00:20:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:20:38,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:20:38,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -15178155, now seen corresponding path program 1 times [2024-11-17 00:20:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290867727] [2024-11-17 00:20:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,481 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-17 00:20:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290867727] [2024-11-17 00:20:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290867727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:20:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642971041] [2024-11-17 00:20:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:20:38,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:20:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:20:38,484 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-17 00:20:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,519 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-17 00:20:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:20:38,520 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-17 00:20:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,520 INFO L225 Difference]: With dead ends: 38 [2024-11-17 00:20:38,520 INFO L226 Difference]: Without dead ends: 38 [2024-11-17 00:20:38,521 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-17 00:20:38,521 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 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-17 00:20:38,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-17 00:20:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-17 00:20:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-17 00:20:38,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 7 [2024-11-17 00:20:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,530 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-17 00:20:38,530 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-17 00:20:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-17 00:20:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:20:38,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:20:38,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash -15178154, now seen corresponding path program 1 times [2024-11-17 00:20:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583020797] [2024-11-17 00:20:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,657 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-17 00:20:38,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583020797] [2024-11-17 00:20:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583020797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:20:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785711565] [2024-11-17 00:20:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:20:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:20:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:20:38,659 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-17 00:20:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,685 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-17 00:20:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:20:38,685 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-17 00:20:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,686 INFO L225 Difference]: With dead ends: 41 [2024-11-17 00:20:38,686 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 00:20:38,686 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-17 00:20:38,687 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:38,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 00:20:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-17 00:20:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 40 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-17 00:20:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-17 00:20:38,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 7 [2024-11-17 00:20:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,697 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-17 00:20:38,697 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-17 00:20:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-17 00:20:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:20:38,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:20:38,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash -15148363, now seen corresponding path program 1 times [2024-11-17 00:20:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683354881] [2024-11-17 00:20:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,821 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-17 00:20:38,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683354881] [2024-11-17 00:20:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683354881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:20:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993279586] [2024-11-17 00:20:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:20:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:20:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:20:38,825 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-17 00:20:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,845 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-17 00:20:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:20:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-17 00:20:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,846 INFO L225 Difference]: With dead ends: 40 [2024-11-17 00:20:38,847 INFO L226 Difference]: Without dead ends: 40 [2024-11-17 00:20:38,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:20:38,850 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:38,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-17 00:20:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-17 00:20:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 36 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-17 00:20:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-17 00:20:38,856 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 7 [2024-11-17 00:20:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,856 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-17 00:20:38,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-17 00:20:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-17 00:20:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:20:38,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:20:38,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1200833704, now seen corresponding path program 1 times [2024-11-17 00:20:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417442658] [2024-11-17 00:20:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:38,916 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-17 00:20:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417442658] [2024-11-17 00:20:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417442658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:20:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258891885] [2024-11-17 00:20:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:20:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:20:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:20:38,920 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-17 00:20:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:38,971 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-17 00:20:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:20:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:20:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:38,973 INFO L225 Difference]: With dead ends: 35 [2024-11-17 00:20:38,973 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 00:20:38,974 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-17 00:20:38,975 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:38,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 00:20:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 00:20:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-17 00:20:38,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2024-11-17 00:20:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-17 00:20:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-17 00:20:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-17 00:20:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:20:38,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:38,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:20:38,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1200833703, now seen corresponding path program 1 times [2024-11-17 00:20:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066287457] [2024-11-17 00:20:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066287457] [2024-11-17 00:20:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066287457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:39,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:39,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:20:39,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562243311] [2024-11-17 00:20:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:39,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:20:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:39,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:20:39,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:20:39,102 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-17 00:20:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:39,173 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-17 00:20:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:20:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:20:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:39,176 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:20:39,176 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 00:20:39,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:20:39,177 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:20:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 00:20:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2024-11-17 00:20:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.5) internal successors, (45), 38 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-17 00:20:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-17 00:20:39,186 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 10 [2024-11-17 00:20:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:39,186 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-17 00:20:39,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-17 00:20:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-17 00:20:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:20:39,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:39,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:39,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:20:39,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:39,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1541470732, now seen corresponding path program 1 times [2024-11-17 00:20:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794238896] [2024-11-17 00:20:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:39,326 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-17 00:20:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794238896] [2024-11-17 00:20:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794238896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:20:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822389554] [2024-11-17 00:20:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:20:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:20:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:20:39,330 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:39,360 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-17 00:20:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:20:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:20:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:39,361 INFO L225 Difference]: With dead ends: 38 [2024-11-17 00:20:39,361 INFO L226 Difference]: Without dead ends: 34 [2024-11-17 00:20:39,361 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-17 00:20:39,362 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:39,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-17 00:20:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-17 00:20:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-17 00:20:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-17 00:20:39,368 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2024-11-17 00:20:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:39,368 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-17 00:20:39,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-17 00:20:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:20:39,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:39,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:39,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:20:39,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:39,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1544119182, now seen corresponding path program 1 times [2024-11-17 00:20:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:39,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038584673] [2024-11-17 00:20:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:39,434 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-17 00:20:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038584673] [2024-11-17 00:20:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038584673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:20:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801313243] [2024-11-17 00:20:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:39,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:20:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:20:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:20:39,437 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:39,487 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-17 00:20:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:20:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:20:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:39,488 INFO L225 Difference]: With dead ends: 31 [2024-11-17 00:20:39,488 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 00:20:39,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:20:39,490 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:39,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 00:20:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-17 00:20:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 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-17 00:20:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-17 00:20:39,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2024-11-17 00:20:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:39,495 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-17 00:20:39,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-17 00:20:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:20:39,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:39,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:20:39,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1544119183, now seen corresponding path program 1 times [2024-11-17 00:20:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244884612] [2024-11-17 00:20:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:39,688 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-17 00:20:39,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244884612] [2024-11-17 00:20:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244884612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:20:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834761874] [2024-11-17 00:20:39,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:39,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:20:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:20:39,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:20:39,692 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:39,777 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-17 00:20:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:20:39,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:20:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:39,778 INFO L225 Difference]: With dead ends: 39 [2024-11-17 00:20:39,778 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 00:20:39,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:20:39,779 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:39,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:20:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 00:20:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-17 00:20:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 38 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-17 00:20:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-17 00:20:39,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 15 [2024-11-17 00:20:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:39,786 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-17 00:20:39,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-17 00:20:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:20:39,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:39,787 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:39,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:20:39,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:39,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1551865913, now seen corresponding path program 1 times [2024-11-17 00:20:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183538442] [2024-11-17 00:20:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:39,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183538442] [2024-11-17 00:20:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183538442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:39,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:20:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591441582] [2024-11-17 00:20:39,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:20:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:39,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:20:39,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:20:39,823 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:39,832 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-17 00:20:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:20:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:20:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:39,837 INFO L225 Difference]: With dead ends: 41 [2024-11-17 00:20:39,837 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 00:20:39,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:20:39,838 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 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-17 00:20:39,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 00:20:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-17 00:20:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-17 00:20:39,843 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2024-11-17 00:20:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:39,844 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-17 00:20:39,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-17 00:20:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:20:39,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:39,844 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:39,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:20:39,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:39,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1016579319, now seen corresponding path program 1 times [2024-11-17 00:20:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500179200] [2024-11-17 00:20:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:20:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:40,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500179200] [2024-11-17 00:20:40,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500179200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:40,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:20:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884986118] [2024-11-17 00:20:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:40,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:20:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:20:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:20:40,037 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:40,077 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-17 00:20:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:20:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:20:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:40,078 INFO L225 Difference]: With dead ends: 49 [2024-11-17 00:20:40,078 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 00:20:40,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:20:40,079 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:40,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:20:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 00:20:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-17 00:20:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 40 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-17 00:20:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-17 00:20:40,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 22 [2024-11-17 00:20:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:40,086 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-17 00:20:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-17 00:20:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:20:40,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:40,087 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:20:40,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:40,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1425403544, now seen corresponding path program 1 times [2024-11-17 00:20:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:40,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044749604] [2024-11-17 00:20:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044749604] [2024-11-17 00:20:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044749604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:20:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:20:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:20:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692988496] [2024-11-17 00:20:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:20:40,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:20:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:20:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:20:40,302 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:40,382 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-17 00:20:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:20:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:20:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:40,383 INFO L225 Difference]: With dead ends: 63 [2024-11-17 00:20:40,383 INFO L226 Difference]: Without dead ends: 63 [2024-11-17 00:20:40,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:20:40,384 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:40,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 136 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:20:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-17 00:20:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-11-17 00:20:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-17 00:20:40,388 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 22 [2024-11-17 00:20:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:40,388 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-17 00:20:40,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-17 00:20:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:20:40,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:40,389 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:40,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:20:40,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1400683325, now seen corresponding path program 1 times [2024-11-17 00:20:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291945584] [2024-11-17 00:20:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:40,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:40,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291945584] [2024-11-17 00:20:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291945584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:20:40,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721590311] [2024-11-17 00:20:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:40,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:20:40,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:20:40,646 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-17 00:20:40,648 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-17 00:20:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:40,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 00:20:40,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:20:40,846 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-17 00:20:41,185 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:20:41,185 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 26 treesize of output 19 [2024-11-17 00:20:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:41,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:20:41,747 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-17 00:20:41,756 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-17 00:20:41,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 00:20:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721590311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:20:41,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:20:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 25 [2024-11-17 00:20:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355743286] [2024-11-17 00:20:41,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:20:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:20:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:20:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:20:41,783 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:42,377 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2024-11-17 00:20:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:20:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:20:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:42,379 INFO L225 Difference]: With dead ends: 171 [2024-11-17 00:20:42,379 INFO L226 Difference]: Without dead ends: 171 [2024-11-17 00:20:42,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:20:42,380 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 97 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:42,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 233 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:20:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-17 00:20:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 128. [2024-11-17 00:20:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.1935483870967742) internal successors, (148), 127 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-17 00:20:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2024-11-17 00:20:42,387 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 22 [2024-11-17 00:20:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:42,387 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2024-11-17 00:20:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2024-11-17 00:20:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:20:42,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:42,388 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:42,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:20:42,592 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,SelfDestructingSolverStorable14 [2024-11-17 00:20:42,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2025091881, now seen corresponding path program 1 times [2024-11-17 00:20:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685948980] [2024-11-17 00:20:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:42,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:42,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685948980] [2024-11-17 00:20:42,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685948980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:20:42,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686767948] [2024-11-17 00:20:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:42,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:20:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:20:42,960 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-17 00:20:42,962 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-17 00:20:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:20:43,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:20:43,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 00:20:43,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:20:43,250 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 17 treesize of output 15 [2024-11-17 00:20:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:43,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:20:43,640 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-17 00:20:43,644 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-17 00:20:43,650 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-17 00:20:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686767948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:20:43,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:20:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2024-11-17 00:20:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90064896] [2024-11-17 00:20:43,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:20:43,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:20:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:20:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:20:43,689 INFO L87 Difference]: Start difference. First operand 128 states and 148 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-17 00:20:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:44,175 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2024-11-17 00:20:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:20:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:20:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:44,177 INFO L225 Difference]: With dead ends: 156 [2024-11-17 00:20:44,177 INFO L226 Difference]: Without dead ends: 156 [2024-11-17 00:20:44,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:20:44,178 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:44,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:20:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-17 00:20:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-17 00:20:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.1451612903225807) internal successors, (142), 125 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-17 00:20:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2024-11-17 00:20:44,183 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 22 [2024-11-17 00:20:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:44,183 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2024-11-17 00:20:44,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-17 00:20:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2024-11-17 00:20:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:20:44,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:44,184 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:44,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:20:44,388 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,SelfDestructingSolverStorable15 [2024-11-17 00:20:44,389 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:44,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -814527953, now seen corresponding path program 2 times [2024-11-17 00:20:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200467193] [2024-11-17 00:20:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200467193] [2024-11-17 00:20:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200467193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:20:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231056008] [2024-11-17 00:20:44,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:20:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:20:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:20:44,972 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-17 00:20:44,974 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-17 00:20:45,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:20:45,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:20:45,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-17 00:20:45,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:20:45,103 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-17 00:20:45,562 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-17 00:20:45,562 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-17 00:20:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:45,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:20:46,207 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-17 00:20:46,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:20:46,212 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-17 00:20:46,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-17 00:20:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231056008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:20:46,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:20:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-17 00:20:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279680066] [2024-11-17 00:20:46,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:20:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-17 00:20:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:20:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-17 00:20:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2024-11-17 00:20:46,295 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:20:47,629 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2024-11-17 00:20:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:20:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:20:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:20:47,631 INFO L225 Difference]: With dead ends: 161 [2024-11-17 00:20:47,631 INFO L226 Difference]: Without dead ends: 161 [2024-11-17 00:20:47,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=365, Invalid=2085, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:20:47,632 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:20:47,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 255 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:20:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-17 00:20:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 98. [2024-11-17 00:20:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.092783505154639) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-17 00:20:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-17 00:20:47,636 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 29 [2024-11-17 00:20:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:20:47,636 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-17 00:20:47,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:20:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-17 00:20:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:20:47,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:20:47,638 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:20:47,652 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-17 00:20:47,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:20:47,839 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-17 00:20:47,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:20:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash -942779303, now seen corresponding path program 2 times [2024-11-17 00:20:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:20:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284446418] [2024-11-17 00:20:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:20:47,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:20:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:20:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:20:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:20:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284446418] [2024-11-17 00:20:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284446418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:20:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123083732] [2024-11-17 00:20:48,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:20:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:20:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:20:48,367 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-17 00:20:48,369 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-17 00:20:48,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:20:48,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:20:48,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-17 00:20:48,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:20:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-17 00:21:55,350 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-17 00:21:55,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2024-11-17 00:21:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 22 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:21:55,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:21:56,923 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-17 00:21:56,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-17 00:21:56,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-17 00:21:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:21:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123083732] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:21:57,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:21:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29, 22] total 56 [2024-11-17 00:21:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495092438] [2024-11-17 00:21:57,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:21:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-17 00:21:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:21:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-17 00:21:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2676, Unknown=20, NotChecked=0, Total=3192 [2024-11-17 00:21:57,010 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 57 states, 56 states have (on average 2.3035714285714284) internal successors, (129), 57 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:06,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:22:10,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]