./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:59:51,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:59:51,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:59:51,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:59:51,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:59:51,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:59:51,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:59:51,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:59:51,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:59:51,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:59:51,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:59:51,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:59:51,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:59:51,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:59:51,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:59:51,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:59:51,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:59:51,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:59:51,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:59:51,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:59:51,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:59:51,532 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:59:51,532 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:59:51,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:59:51,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:59:51,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:59:51,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:59:51,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:59:51,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:59:51,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:59:51,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:59:51,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:59:51,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:59:51,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:59:51,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:59:51,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:59:51,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:59:51,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:59:51,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:59:51,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:59:51,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:59:51,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:59:51,537 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2024-10-11 17:59:51,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:59:51,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:59:51,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:59:51,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:59:51,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:59:51,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-10-11 17:59:53,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:59:53,406 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:59:53,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-10-11 17:59:53,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f35781bd7/f088b08ce384499883677a60d273d872/FLAG0522fe538 [2024-10-11 17:59:53,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f35781bd7/f088b08ce384499883677a60d273d872 [2024-10-11 17:59:53,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:59:53,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:59:53,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:59:53,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:59:53,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:59:53,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:59:53" (1/1) ... [2024-10-11 17:59:53,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3d0491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:53, skipping insertion in model container [2024-10-11 17:59:53,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:59:53" (1/1) ... [2024-10-11 17:59:53,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:59:54,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:59:54,117 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:59:54,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:59:54,201 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:59:54,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54 WrapperNode [2024-10-11 17:59:54,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:59:54,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:59:54,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:59:54,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:59:54,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,253 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 143 [2024-10-11 17:59:54,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:59:54,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:59:54,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:59:54,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:59:54,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,295 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2024-10-11 17:59:54,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:59:54,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:59:54,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:59:54,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:59:54,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (1/1) ... [2024-10-11 17:59:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:59:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:59:54,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:59:54,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:59:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:59:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:59:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:59:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:59:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:59:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:59:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:59:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:59:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:59:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:59:54,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:59:54,574 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:59:54,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:59:55,018 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-10-11 17:59:55,019 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:59:55,074 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:59:55,074 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:59:55,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:59:55 BoogieIcfgContainer [2024-10-11 17:59:55,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:59:55,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:59:55,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:59:55,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:59:55,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:59:53" (1/3) ... [2024-10-11 17:59:55,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16efd42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:59:55, skipping insertion in model container [2024-10-11 17:59:55,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:59:54" (2/3) ... [2024-10-11 17:59:55,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16efd42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:59:55, skipping insertion in model container [2024-10-11 17:59:55,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:59:55" (3/3) ... [2024-10-11 17:59:55,083 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2024-10-11 17:59:55,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:59:55,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-11 17:59:55,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:59:55,155 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;@5d3c3172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:59:55,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-10-11 17:59:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:59:55,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:55,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:59:55,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:55,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 7940, now seen corresponding path program 1 times [2024-10-11 17:59:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022972100] [2024-10-11 17:59:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022972100] [2024-10-11 17:59:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022972100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:59:55,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096907692] [2024-10-11 17:59:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:59:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:59:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:55,387 INFO L87 Difference]: Start difference. First operand has 120 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:55,569 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2024-10-11 17:59:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:59:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 17:59:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:55,583 INFO L225 Difference]: With dead ends: 118 [2024-10-11 17:59:55,584 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 17:59:55,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:55,591 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 70 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:55,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 101 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:59:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 17:59:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 17:59:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 52 states have (on average 2.4423076923076925) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2024-10-11 17:59:55,634 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 2 [2024-10-11 17:59:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:55,634 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2024-10-11 17:59:55,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-10-11 17:59:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:59:55,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:55,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:59:55,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:59:55,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:55,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 7941, now seen corresponding path program 1 times [2024-10-11 17:59:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399969711] [2024-10-11 17:59:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399969711] [2024-10-11 17:59:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399969711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:59:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121609530] [2024-10-11 17:59:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:55,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:59:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:59:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:55,760 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:55,889 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2024-10-11 17:59:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:59:55,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 17:59:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:55,891 INFO L225 Difference]: With dead ends: 115 [2024-10-11 17:59:55,892 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 17:59:55,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:55,894 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 70 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:55,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 106 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 17:59:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 17:59:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2024-10-11 17:59:55,909 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 2 [2024-10-11 17:59:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2024-10-11 17:59:55,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2024-10-11 17:59:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:59:55,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:55,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:59:55,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:59:55,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:55,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1257909552, now seen corresponding path program 1 times [2024-10-11 17:59:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:55,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890594513] [2024-10-11 17:59:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890594513] [2024-10-11 17:59:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890594513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:59:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364706754] [2024-10-11 17:59:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:59:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:59:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:59:55,987 INFO L87 Difference]: Start difference. First operand 115 states and 125 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-10-11 17:59:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:56,185 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-10-11 17:59:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:56,186 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-10-11 17:59:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:56,187 INFO L225 Difference]: With dead ends: 120 [2024-10-11 17:59:56,187 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 17:59:56,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:56,188 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:56,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 91 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:59:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 17:59:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-10-11 17:59:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 100 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-10-11 17:59:56,203 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 6 [2024-10-11 17:59:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-10-11 17:59:56,203 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-10-11 17:59:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-10-11 17:59:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:59:56,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:56,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:59:56,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:59:56,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:56,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1257909551, now seen corresponding path program 1 times [2024-10-11 17:59:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660591454] [2024-10-11 17:59:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660591454] [2024-10-11 17:59:56,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660591454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:56,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:56,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:59:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221919147] [2024-10-11 17:59:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:56,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:59:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:59:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:59:56,377 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.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-10-11 17:59:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:56,590 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-10-11 17:59:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-10-11 17:59:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:56,593 INFO L225 Difference]: With dead ends: 147 [2024-10-11 17:59:56,596 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 17:59:56,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:56,597 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 136 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:56,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 141 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:59:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 17:59:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2024-10-11 17:59:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2024-10-11 17:59:56,610 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 6 [2024-10-11 17:59:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2024-10-11 17:59:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-10-11 17:59:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2024-10-11 17:59:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:59:56,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:56,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:56,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:59:56,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -340488952, now seen corresponding path program 1 times [2024-10-11 17:59:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926649809] [2024-10-11 17:59:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926649809] [2024-10-11 17:59:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926649809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:59:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867148503] [2024-10-11 17:59:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:59:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:59:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:56,667 INFO L87 Difference]: Start difference. First operand 122 states and 145 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-10-11 17:59:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:56,752 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2024-10-11 17:59:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:59:56,752 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-10-11 17:59:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:56,753 INFO L225 Difference]: With dead ends: 133 [2024-10-11 17:59:56,753 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 17:59:56,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:56,755 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:56,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 17:59:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2024-10-11 17:59:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 121 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-10-11 17:59:56,764 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 7 [2024-10-11 17:59:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-10-11 17:59:56,765 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-10-11 17:59:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2024-10-11 17:59:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:59:56,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:56,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:56,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:59:56,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -340488951, now seen corresponding path program 1 times [2024-10-11 17:59:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191367215] [2024-10-11 17:59:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191367215] [2024-10-11 17:59:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191367215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:59:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946932367] [2024-10-11 17:59:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:59:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:59:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:56,858 INFO L87 Difference]: Start difference. First operand 122 states and 147 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-10-11 17:59:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:56,950 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2024-10-11 17:59:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:59:56,951 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-10-11 17:59:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:56,951 INFO L225 Difference]: With dead ends: 120 [2024-10-11 17:59:56,952 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 17:59:56,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:56,953 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:56,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 17:59:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 17:59:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.894736842105263) internal successors, (144), 119 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2024-10-11 17:59:56,965 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 7 [2024-10-11 17:59:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:56,965 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2024-10-11 17:59:56,965 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-10-11 17:59:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2024-10-11 17:59:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:59:56,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:56,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:56,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:59:56,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:56,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1253582969, now seen corresponding path program 1 times [2024-10-11 17:59:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172140317] [2024-10-11 17:59:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:57,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:57,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172140317] [2024-10-11 17:59:57,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172140317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:57,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:57,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:59:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465302308] [2024-10-11 17:59:57,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:57,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:57,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:57,045 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:57,192 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2024-10-11 17:59:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:59:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:57,193 INFO L225 Difference]: With dead ends: 126 [2024-10-11 17:59:57,193 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 17:59:57,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:57,194 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 18 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:57,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 17:59:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2024-10-11 17:59:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 115 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2024-10-11 17:59:57,209 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 11 [2024-10-11 17:59:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2024-10-11 17:59:57,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2024-10-11 17:59:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:59:57,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:57,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:59:57,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1253582968, now seen corresponding path program 1 times [2024-10-11 17:59:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918219558] [2024-10-11 17:59:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918219558] [2024-10-11 17:59:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918219558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:59:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003522802] [2024-10-11 17:59:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:57,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:59:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:59:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:59:57,327 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:57,487 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2024-10-11 17:59:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:59:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:57,489 INFO L225 Difference]: With dead ends: 126 [2024-10-11 17:59:57,489 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 17:59:57,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:57,491 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:57,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 17:59:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2024-10-11 17:59:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.7674418604651163) internal successors, (152), 120 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2024-10-11 17:59:57,501 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 11 [2024-10-11 17:59:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2024-10-11 17:59:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2024-10-11 17:59:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:59:57,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:57,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:57,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:59:57,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:57,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1253585422, now seen corresponding path program 1 times [2024-10-11 17:59:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972104342] [2024-10-11 17:59:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:57,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972104342] [2024-10-11 17:59:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972104342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:57,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:57,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:59:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690704983] [2024-10-11 17:59:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:57,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:59:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:59:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:57,543 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:57,588 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2024-10-11 17:59:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:59:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:59:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:57,590 INFO L225 Difference]: With dead ends: 121 [2024-10-11 17:59:57,593 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 17:59:57,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:59:57,594 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:57,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:59:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 17:59:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 17:59:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.755813953488372) internal successors, (151), 120 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2024-10-11 17:59:57,598 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 11 [2024-10-11 17:59:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-10-11 17:59:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2024-10-11 17:59:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:59:57,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:57,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:59:57,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1345697709, now seen corresponding path program 1 times [2024-10-11 17:59:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559116175] [2024-10-11 17:59:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559116175] [2024-10-11 17:59:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559116175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:59:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41221581] [2024-10-11 17:59:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:57,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:57,738 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:57,895 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-10-11 17:59:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:59:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:59:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:57,896 INFO L225 Difference]: With dead ends: 149 [2024-10-11 17:59:57,896 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 17:59:57,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:59:57,897 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:57,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 253 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 17:59:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 134. [2024-10-11 17:59:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.707070707070707) internal successors, (169), 133 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2024-10-11 17:59:57,901 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 11 [2024-10-11 17:59:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:57,901 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2024-10-11 17:59:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2024-10-11 17:59:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:59:57,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:57,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:59:57,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:57,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2102311371, now seen corresponding path program 1 times [2024-10-11 17:59:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133099364] [2024-10-11 17:59:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133099364] [2024-10-11 17:59:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133099364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:57,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:59:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320023278] [2024-10-11 17:59:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:57,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:57,985 INFO L87 Difference]: Start difference. First operand 134 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:58,080 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-10-11 17:59:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:59:58,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:59:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:58,082 INFO L225 Difference]: With dead ends: 140 [2024-10-11 17:59:58,082 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 17:59:58,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:59:58,083 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:58,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 211 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 17:59:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2024-10-11 17:59:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 100 states have (on average 1.7) internal successors, (170), 134 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2024-10-11 17:59:58,088 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 13 [2024-10-11 17:59:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:58,089 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2024-10-11 17:59:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2024-10-11 17:59:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:59:58,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:58,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:59:58,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1688505897, now seen corresponding path program 1 times [2024-10-11 17:59:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577794856] [2024-10-11 17:59:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577794856] [2024-10-11 17:59:58,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577794856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:58,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:58,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:59:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160565229] [2024-10-11 17:59:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:58,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:58,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:58,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:58,196 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:58,332 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2024-10-11 17:59:58,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:58,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:59:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:58,336 INFO L225 Difference]: With dead ends: 134 [2024-10-11 17:59:58,336 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 17:59:58,336 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-10-11 17:59:58,336 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:58,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 199 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 17:59:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-11 17:59:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.68) internal successors, (168), 133 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2024-10-11 17:59:58,340 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 14 [2024-10-11 17:59:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2024-10-11 17:59:58,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2024-10-11 17:59:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:59:58,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:58,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:58,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:59:58,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:58,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1688505896, now seen corresponding path program 1 times [2024-10-11 17:59:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:58,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238875315] [2024-10-11 17:59:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238875315] [2024-10-11 17:59:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238875315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:58,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:59:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230351622] [2024-10-11 17:59:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:58,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:58,473 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:58,615 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2024-10-11 17:59:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:59:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:59:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:58,616 INFO L225 Difference]: With dead ends: 133 [2024-10-11 17:59:58,616 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 17:59:58,617 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-10-11 17:59:58,617 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:58,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 17:59:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 17:59:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.66) internal successors, (166), 132 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2024-10-11 17:59:58,633 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 14 [2024-10-11 17:59:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2024-10-11 17:59:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2024-10-11 17:59:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:59:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:58,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:58,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:59:58,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1686592360, now seen corresponding path program 1 times [2024-10-11 17:59:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251471278] [2024-10-11 17:59:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251471278] [2024-10-11 17:59:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251471278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:59:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365902512] [2024-10-11 17:59:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:58,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:59:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:59:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:59:58,978 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:59,349 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2024-10-11 17:59:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:59:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:59:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:59,350 INFO L225 Difference]: With dead ends: 147 [2024-10-11 17:59:59,350 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 17:59:59,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:59:59,351 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 102 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:59,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 172 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:59:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 17:59:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-10-11 17:59:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 136 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2024-10-11 17:59:59,355 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 15 [2024-10-11 17:59:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:59,355 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2024-10-11 17:59:59,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2024-10-11 17:59:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:59:59,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:59,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:59,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:59:59,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:59:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1686592359, now seen corresponding path program 1 times [2024-10-11 17:59:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295880417] [2024-10-11 17:59:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295880417] [2024-10-11 17:59:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295880417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:59:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899649334] [2024-10-11 17:59:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:59,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:59:59,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:59,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:59:59,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:59:59,683 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:00,173 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2024-10-11 18:00:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:00:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:00:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:00,176 INFO L225 Difference]: With dead ends: 164 [2024-10-11 18:00:00,176 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 18:00:00,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:00:00,178 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 132 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:00,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 243 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:00:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 18:00:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2024-10-11 18:00:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.5897435897435896) internal successors, (186), 149 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2024-10-11 18:00:00,181 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 15 [2024-10-11 18:00:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:00,182 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2024-10-11 18:00:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2024-10-11 18:00:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:00:00,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:00,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:00:00,183 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 843616720, now seen corresponding path program 1 times [2024-10-11 18:00:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388547091] [2024-10-11 18:00:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388547091] [2024-10-11 18:00:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388547091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:00:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803145349] [2024-10-11 18:00:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:00,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:00,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:00,412 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:00,680 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2024-10-11 18:00:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:00:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:00:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:00,682 INFO L225 Difference]: With dead ends: 159 [2024-10-11 18:00:00,682 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 18:00:00,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:00:00,683 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 95 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:00,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 163 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 18:00:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-10-11 18:00:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 148 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2024-10-11 18:00:00,686 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 16 [2024-10-11 18:00:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2024-10-11 18:00:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2024-10-11 18:00:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:00:00,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:00,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:00:00,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 843616721, now seen corresponding path program 1 times [2024-10-11 18:00:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215841067] [2024-10-11 18:00:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215841067] [2024-10-11 18:00:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215841067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:00:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109162556] [2024-10-11 18:00:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:00,924 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:01,298 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-10-11 18:00:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:00:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:00:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:01,299 INFO L225 Difference]: With dead ends: 158 [2024-10-11 18:00:01,299 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 18:00:01,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:00:01,300 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 90 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:01,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 222 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 18:00:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2024-10-11 18:00:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 147 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 182 transitions. [2024-10-11 18:00:01,303 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 182 transitions. Word has length 16 [2024-10-11 18:00:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 182 transitions. [2024-10-11 18:00:01,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2024-10-11 18:00:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:00:01,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:01,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:00:01,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 569384483, now seen corresponding path program 1 times [2024-10-11 18:00:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668007384] [2024-10-11 18:00:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668007384] [2024-10-11 18:00:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668007384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372645744] [2024-10-11 18:00:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:01,370 INFO L87 Difference]: Start difference. First operand 148 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:01,497 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2024-10-11 18:00:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:00:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:01,498 INFO L225 Difference]: With dead ends: 147 [2024-10-11 18:00:01,499 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 18:00:01,499 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-10-11 18:00:01,499 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:01,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 18:00:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 18:00:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 146 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2024-10-11 18:00:01,503 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 17 [2024-10-11 18:00:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:01,503 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2024-10-11 18:00:01,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2024-10-11 18:00:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:00:01,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:01,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:00:01,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 569384484, now seen corresponding path program 1 times [2024-10-11 18:00:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:01,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312168781] [2024-10-11 18:00:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312168781] [2024-10-11 18:00:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312168781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613283444] [2024-10-11 18:00:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:01,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:01,609 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:01,753 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2024-10-11 18:00:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:00:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:01,754 INFO L225 Difference]: With dead ends: 146 [2024-10-11 18:00:01,754 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 18:00:01,755 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-10-11 18:00:01,755 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:01,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 18:00:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-11 18:00:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-10-11 18:00:01,758 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 17 [2024-10-11 18:00:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:01,759 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-10-11 18:00:01,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-10-11 18:00:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:00:01,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:01,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:00:01,760 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1717743341, now seen corresponding path program 1 times [2024-10-11 18:00:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375090241] [2024-10-11 18:00:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:01,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375090241] [2024-10-11 18:00:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375090241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:00:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100263075] [2024-10-11 18:00:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:01,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:01,933 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:02,255 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2024-10-11 18:00:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:00:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:00:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:02,256 INFO L225 Difference]: With dead ends: 155 [2024-10-11 18:00:02,256 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 18:00:02,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:00:02,257 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 81 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:02,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 210 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 18:00:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2024-10-11 18:00:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 144 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-10-11 18:00:02,261 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 19 [2024-10-11 18:00:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:02,261 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-10-11 18:00:02,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-10-11 18:00:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:00:02,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:02,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:02,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:00:02,262 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:02,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1717743342, now seen corresponding path program 1 times [2024-10-11 18:00:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:02,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795565219] [2024-10-11 18:00:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795565219] [2024-10-11 18:00:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795565219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:00:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279314756] [2024-10-11 18:00:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:02,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:02,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:02,524 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:02,907 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2024-10-11 18:00:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:00:02,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:00:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:02,909 INFO L225 Difference]: With dead ends: 154 [2024-10-11 18:00:02,909 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 18:00:02,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:00:02,910 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 80 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:02,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 219 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 18:00:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2024-10-11 18:00:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 143 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2024-10-11 18:00:02,913 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 19 [2024-10-11 18:00:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:02,914 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2024-10-11 18:00:02,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2024-10-11 18:00:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:00:02,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:02,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:02,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:00:02,914 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1240712948, now seen corresponding path program 1 times [2024-10-11 18:00:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448525069] [2024-10-11 18:00:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:03,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448525069] [2024-10-11 18:00:03,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448525069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:03,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:00:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260760891] [2024-10-11 18:00:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:03,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:03,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:03,103 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10-11 18:00:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:03,389 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2024-10-11 18:00:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:00:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10-11 18:00:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:03,391 INFO L225 Difference]: With dead ends: 156 [2024-10-11 18:00:03,391 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 18:00:03,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:00:03,392 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 122 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:03,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 272 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 18:00:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2024-10-11 18:00:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.495798319327731) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-10-11 18:00:03,396 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 20 [2024-10-11 18:00:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:03,397 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-10-11 18:00:03,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10-11 18:00:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-10-11 18:00:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:00:03,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:03,398 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, 1] [2024-10-11 18:00:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:00:03,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:03,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 409345024, now seen corresponding path program 1 times [2024-10-11 18:00:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279834565] [2024-10-11 18:00:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279834565] [2024-10-11 18:00:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279834565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:00:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33128234] [2024-10-11 18:00:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:00:03,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:00:03,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:00:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:03,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:00:03,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:03,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:00:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:00:03,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:00:03,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:00:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:03,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33128234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:03,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:00:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-11 18:00:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338931773] [2024-10-11 18:00:03,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:03,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:03,862 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:03,936 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2024-10-11 18:00:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:00:03,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 18:00:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:03,938 INFO L225 Difference]: With dead ends: 149 [2024-10-11 18:00:03,938 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 18:00:03,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:03,940 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:03,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 18:00:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-10-11 18:00:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.487603305785124) internal successors, (180), 147 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 180 transitions. [2024-10-11 18:00:03,944 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 180 transitions. Word has length 23 [2024-10-11 18:00:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:03,944 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 180 transitions. [2024-10-11 18:00:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 180 transitions. [2024-10-11 18:00:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:00:03,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:03,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:03,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:00:04,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:00:04,147 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:04,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -195205997, now seen corresponding path program 1 times [2024-10-11 18:00:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379479933] [2024-10-11 18:00:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379479933] [2024-10-11 18:00:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379479933] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:00:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725196253] [2024-10-11 18:00:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:00:04,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:00:04,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:00:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:04,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:00:04,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:04,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:00:04,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:04,738 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 46 treesize of output 36 [2024-10-11 18:00:05,012 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1.base_102| Int) (|v_ULTIMATE.start_main_~st~0#1.base_44| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_102| 1) |v_ULTIMATE.start_main_~st~0#1.base_44|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_102|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~st~0#1.base_44| 0) |v_ULTIMATE.start_main_~n~0#1.base_102| 0)))) is different from true [2024-10-11 18:00:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 18:00:05,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 18:00:05,139 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 38 treesize of output 36 [2024-10-11 18:00:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725196253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:13,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:00:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-11 18:00:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134635831] [2024-10-11 18:00:13,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:13,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:00:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:00:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=444, Unknown=3, NotChecked=42, Total=552 [2024-10-11 18:00:13,530 INFO L87 Difference]: Start difference. First operand 148 states and 180 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:14,477 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2024-10-11 18:00:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:00:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:00:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:14,479 INFO L225 Difference]: With dead ends: 176 [2024-10-11 18:00:14,479 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 18:00:14,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=132, Invalid=925, Unknown=3, NotChecked=62, Total=1122 [2024-10-11 18:00:14,480 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 56 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:14,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 561 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 736 Invalid, 0 Unknown, 132 Unchecked, 0.6s Time] [2024-10-11 18:00:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 18:00:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-10-11 18:00:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 160 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2024-10-11 18:00:14,484 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 24 [2024-10-11 18:00:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:14,485 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2024-10-11 18:00:14,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2024-10-11 18:00:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:00:14,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:14,486 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, 1, 1, 1, 1] [2024-10-11 18:00:14,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:00:14,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:14,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:14,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 589922832, now seen corresponding path program 1 times [2024-10-11 18:00:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203610246] [2024-10-11 18:00:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203610246] [2024-10-11 18:00:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203610246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:00:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929912652] [2024-10-11 18:00:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:00:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:00:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:14,848 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:15,050 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2024-10-11 18:00:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:00:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:00:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:15,052 INFO L225 Difference]: With dead ends: 182 [2024-10-11 18:00:15,052 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 18:00:15,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:00:15,052 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:15,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 110 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 18:00:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 161. [2024-10-11 18:00:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 160 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2024-10-11 18:00:15,058 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 26 [2024-10-11 18:00:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:15,058 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2024-10-11 18:00:15,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2024-10-11 18:00:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:00:15,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:15,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:15,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:00:15,060 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1107741208, now seen corresponding path program 1 times [2024-10-11 18:00:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534639887] [2024-10-11 18:00:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:00:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534639887] [2024-10-11 18:00:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534639887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:15,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:00:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295528054] [2024-10-11 18:00:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:15,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:15,121 INFO L87 Difference]: Start difference. First operand 161 states and 193 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:15,215 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2024-10-11 18:00:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:00:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-11 18:00:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:15,217 INFO L225 Difference]: With dead ends: 160 [2024-10-11 18:00:15,217 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 18:00:15,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:15,217 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:15,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 18:00:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-11 18:00:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 159 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 191 transitions. [2024-10-11 18:00:15,227 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 191 transitions. Word has length 27 [2024-10-11 18:00:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:15,227 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 191 transitions. [2024-10-11 18:00:15,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 191 transitions. [2024-10-11 18:00:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:00:15,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:15,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:00:15,228 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1107738755, now seen corresponding path program 1 times [2024-10-11 18:00:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794301824] [2024-10-11 18:00:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794301824] [2024-10-11 18:00:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794301824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644010941] [2024-10-11 18:00:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:15,276 INFO L87 Difference]: Start difference. First operand 160 states and 191 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:15,346 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2024-10-11 18:00:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:15,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-11 18:00:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:15,347 INFO L225 Difference]: With dead ends: 166 [2024-10-11 18:00:15,347 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 18:00:15,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:15,348 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:15,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 18:00:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-10-11 18:00:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2024-10-11 18:00:15,352 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 27 [2024-10-11 18:00:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:15,353 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2024-10-11 18:00:15,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2024-10-11 18:00:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:00:15,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:15,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:00:15,354 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:15,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash -545400045, now seen corresponding path program 1 times [2024-10-11 18:00:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155032879] [2024-10-11 18:00:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155032879] [2024-10-11 18:00:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155032879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:00:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882344331] [2024-10-11 18:00:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:00:16,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:00:16,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:00:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:16,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:00:16,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:16,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:16,569 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 18:00:16,569 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 30 treesize of output 25 [2024-10-11 18:00:16,583 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 18:00:16,583 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 24 treesize of output 12 [2024-10-11 18:00:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882344331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:16,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:00:16,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 20 [2024-10-11 18:00:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453050354] [2024-10-11 18:00:16,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:16,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:00:16,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:00:16,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:00:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:00:16,639 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:17,720 INFO L93 Difference]: Finished difference Result 290 states and 354 transitions. [2024-10-11 18:00:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 18:00:17,721 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:00:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:17,722 INFO L225 Difference]: With dead ends: 290 [2024-10-11 18:00:17,722 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 18:00:17,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 18:00:17,724 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 419 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:17,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 507 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:00:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 18:00:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2024-10-11 18:00:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 151 states have (on average 1.3973509933774835) internal successors, (211), 176 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2024-10-11 18:00:17,731 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 28 [2024-10-11 18:00:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2024-10-11 18:00:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2024-10-11 18:00:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:00:17,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:17,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:17,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:00:17,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:17,934 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 18:00:17,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1967429320, now seen corresponding path program 1 times [2024-10-11 18:00:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:00:17,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770179614] [2024-10-11 18:00:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:00:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:00:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770179614] [2024-10-11 18:00:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770179614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:00:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283664318] [2024-10-11 18:00:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:18,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:00:18,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:00:18,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:00:18,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:00:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:18,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:00:18,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:18,689 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:00:18,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:00:18,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:00:18,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:18,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:00:18,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:18,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:00:18,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:00:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:19,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:19,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_881)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-10-11 18:00:19,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_881))) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-10-11 18:00:19,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:19,185 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2024-10-11 18:00:19,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:19,194 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 170 treesize of output 145 [2024-10-11 18:00:19,201 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 94 treesize of output 86 [2024-10-11 18:00:19,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:19,211 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 86 treesize of output 74 [2024-10-11 18:00:23,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:23,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 269 treesize of output 1595