./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:57:20,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:57:20,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:57:20,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:57:20,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:57:20,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:57:20,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:57:20,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:57:20,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:57:20,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:57:20,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:57:20,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:57:20,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:57:20,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:57:20,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:57:20,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:57:20,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:57:20,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:57:20,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:57:20,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:57:20,408 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:57:20,408 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:57:20,409 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:57:20,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:57:20,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:57:20,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:57:20,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:57:20,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:57:20,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:57:20,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:57:20,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:57:20,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:57:20,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:57:20,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:20,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:57:20,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:57:20,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:57:20,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:57:20,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:57:20,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:57:20,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:57:20,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:57:20,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2024-11-09 07:57:20,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:57:20,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:57:20,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:57:20,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:57:20,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:57:20,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2024-11-09 07:57:22,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:57:22,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:57:22,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2024-11-09 07:57:22,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccd8c987/ea27cbc8d719434ab55a4c3c319d3b42/FLAG24870c947 [2024-11-09 07:57:22,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccd8c987/ea27cbc8d719434ab55a4c3c319d3b42 [2024-11-09 07:57:22,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:57:22,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:57:22,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:22,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:57:22,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:57:22,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dffa1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22, skipping insertion in model container [2024-11-09 07:57:22,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:57:22,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:22,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:57:22,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:22,668 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:57:22,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22 WrapperNode [2024-11-09 07:57:22,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:22,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:22,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:57:22,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:57:22,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,731 INFO L138 Inliner]: procedures = 119, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 234 [2024-11-09 07:57:22,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:22,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:57:22,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:57:22,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:57:22,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,775 INFO L175 MemorySlicer]: Split 35 memory accesses to 2 slices as follows [2, 33]. 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-11-09 07:57:22,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:57:22,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:57:22,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:57:22,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:57:22,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (1/1) ... [2024-11-09 07:57:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:22,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:57:22,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:57:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:57:22,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:57:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:57:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:57:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:57:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:57:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:57:22,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:57:22,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:57:22,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:57:23,455 INFO L? ?]: Removed 154 outVars from TransFormulas that were not future-live. [2024-11-09 07:57:23,456 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:57:23,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:57:23,472 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-09 07:57:23,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:23 BoogieIcfgContainer [2024-11-09 07:57:23,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:57:23,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:57:23,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:57:23,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:57:23,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:57:22" (1/3) ... [2024-11-09 07:57:23,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6e4297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:23, skipping insertion in model container [2024-11-09 07:57:23,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:22" (2/3) ... [2024-11-09 07:57:23,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6e4297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:23, skipping insertion in model container [2024-11-09 07:57:23,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:23" (3/3) ... [2024-11-09 07:57:23,481 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2024-11-09 07:57:23,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:57:23,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2024-11-09 07:57:23,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:57:23,624 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;@10d4524c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:57:23,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2024-11-09 07:57:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 119 states have (on average 2.0756302521008405) internal successors, (247), 193 states have internal predecessors, (247), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:57:23,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:23,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:57:23,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-09 07:57:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:23,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512258321] [2024-11-09 07:57:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512258321] [2024-11-09 07:57:23,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512258321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:23,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382243260] [2024-11-09 07:57:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:23,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:23,853 INFO L87 Difference]: Start difference. First operand has 208 states, 119 states have (on average 2.0756302521008405) internal successors, (247), 193 states have internal predecessors, (247), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:24,027 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2024-11-09 07:57:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 07:57:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:24,037 INFO L225 Difference]: With dead ends: 185 [2024-11-09 07:57:24,037 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 07:57:24,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:24,043 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:24,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 130 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 07:57:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-09 07:57:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.820754716981132) internal successors, (193), 181 states have internal predecessors, (193), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 206 transitions. [2024-11-09 07:57:24,081 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 206 transitions. Word has length 3 [2024-11-09 07:57:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 206 transitions. [2024-11-09 07:57:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 206 transitions. [2024-11-09 07:57:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:57:24,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:24,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:57:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:57:24,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-09 07:57:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837135074] [2024-11-09 07:57:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837135074] [2024-11-09 07:57:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837135074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:24,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417686961] [2024-11-09 07:57:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:24,188 INFO L87 Difference]: Start difference. First operand 183 states and 206 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:24,298 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2024-11-09 07:57:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 07:57:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:24,300 INFO L225 Difference]: With dead ends: 202 [2024-11-09 07:57:24,300 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:57:24,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:24,301 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:24,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 153 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:57:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2024-11-09 07:57:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 190 states have internal predecessors, (213), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 226 transitions. [2024-11-09 07:57:24,309 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 226 transitions. Word has length 3 [2024-11-09 07:57:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:24,309 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 226 transitions. [2024-11-09 07:57:24,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 226 transitions. [2024-11-09 07:57:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:57:24,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:24,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:57:24,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1770896646, now seen corresponding path program 1 times [2024-11-09 07:57:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076227504] [2024-11-09 07:57:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076227504] [2024-11-09 07:57:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076227504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808112332] [2024-11-09 07:57:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:24,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:24,371 INFO L87 Difference]: Start difference. First operand 192 states and 226 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:24,410 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2024-11-09 07:57:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:57:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:24,412 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:57:24,412 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:57:24,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:24,415 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 163 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:24,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 217 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:57:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2024-11-09 07:57:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 123 states have (on average 1.7154471544715446) internal successors, (211), 189 states have internal predecessors, (211), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2024-11-09 07:57:24,424 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 8 [2024-11-09 07:57:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:24,424 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2024-11-09 07:57:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2024-11-09 07:57:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:57:24,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:24,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:24,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:57:24,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1503259545, now seen corresponding path program 1 times [2024-11-09 07:57:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105035173] [2024-11-09 07:57:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105035173] [2024-11-09 07:57:24,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105035173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:24,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:24,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:24,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59047233] [2024-11-09 07:57:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:24,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:24,569 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:24,703 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2024-11-09 07:57:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:57:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:24,704 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:57:24,704 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:57:24,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:24,705 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:24,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 547 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:57:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 07:57:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 123 states have (on average 1.7073170731707317) internal successors, (210), 188 states have internal predecessors, (210), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2024-11-09 07:57:24,715 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 12 [2024-11-09 07:57:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:24,715 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2024-11-09 07:57:24,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2024-11-09 07:57:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:57:24,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:24,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:57:24,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1503259546, now seen corresponding path program 1 times [2024-11-09 07:57:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76558417] [2024-11-09 07:57:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76558417] [2024-11-09 07:57:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76558417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194286540] [2024-11-09 07:57:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:24,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:24,900 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:25,034 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2024-11-09 07:57:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:57:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:25,036 INFO L225 Difference]: With dead ends: 189 [2024-11-09 07:57:25,036 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 07:57:25,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:25,037 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:25,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 556 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 07:57:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-09 07:57:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 123 states have (on average 1.6991869918699187) internal successors, (209), 187 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-11-09 07:57:25,042 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 12 [2024-11-09 07:57:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:25,042 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-11-09 07:57:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-11-09 07:57:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:57:25,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:57:25,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:25,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -874166523, now seen corresponding path program 1 times [2024-11-09 07:57:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055696067] [2024-11-09 07:57:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:25,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055696067] [2024-11-09 07:57:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055696067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656146651] [2024-11-09 07:57:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:25,070 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:25,085 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2024-11-09 07:57:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:25,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:57:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:25,086 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:57:25,086 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:57:25,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:25,087 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:25,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:57:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 07:57:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 124 states have (on average 1.6935483870967742) internal successors, (210), 188 states have internal predecessors, (210), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2024-11-09 07:57:25,096 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 16 [2024-11-09 07:57:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:25,096 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2024-11-09 07:57:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2024-11-09 07:57:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:57:25,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:25,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:57:25,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:25,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash -18865437, now seen corresponding path program 1 times [2024-11-09 07:57:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251103411] [2024-11-09 07:57:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:25,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251103411] [2024-11-09 07:57:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251103411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626870284] [2024-11-09 07:57:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:25,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:25,328 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:25,538 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2024-11-09 07:57:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:25,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:57:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:25,540 INFO L225 Difference]: With dead ends: 189 [2024-11-09 07:57:25,540 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 07:57:25,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:25,541 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 159 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:25,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 430 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 07:57:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-09 07:57:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 124 states have (on average 1.685483870967742) internal successors, (209), 187 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-11-09 07:57:25,545 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 15 [2024-11-09 07:57:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-11-09 07:57:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-11-09 07:57:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:57:25,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:25,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:57:25,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash -18865436, now seen corresponding path program 1 times [2024-11-09 07:57:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467549345] [2024-11-09 07:57:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467549345] [2024-11-09 07:57:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467549345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453687683] [2024-11-09 07:57:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:25,756 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,032 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2024-11-09 07:57:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:26,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:57:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,033 INFO L225 Difference]: With dead ends: 188 [2024-11-09 07:57:26,033 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 07:57:26,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:26,035 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 500 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 07:57:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 07:57:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 124 states have (on average 1.6774193548387097) internal successors, (208), 186 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2024-11-09 07:57:26,039 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 15 [2024-11-09 07:57:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,039 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2024-11-09 07:57:26,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2024-11-09 07:57:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:26,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:57:26,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1330826518, now seen corresponding path program 1 times [2024-11-09 07:57:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058236862] [2024-11-09 07:57:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058236862] [2024-11-09 07:57:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058236862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983053508] [2024-11-09 07:57:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:26,143 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,326 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2024-11-09 07:57:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:57:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,330 INFO L225 Difference]: With dead ends: 267 [2024-11-09 07:57:26,330 INFO L226 Difference]: Without dead ends: 267 [2024-11-09 07:57:26,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:26,331 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 865 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-09 07:57:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 186. [2024-11-09 07:57:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 184 states have internal predecessors, (206), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 217 transitions. [2024-11-09 07:57:26,340 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 217 transitions. Word has length 18 [2024-11-09 07:57:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 217 transitions. [2024-11-09 07:57:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 217 transitions. [2024-11-09 07:57:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:26,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:57:26,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1515180885, now seen corresponding path program 1 times [2024-11-09 07:57:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666152818] [2024-11-09 07:57:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666152818] [2024-11-09 07:57:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666152818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602924599] [2024-11-09 07:57:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:26,495 INFO L87 Difference]: Start difference. First operand 186 states and 217 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,620 INFO L93 Difference]: Finished difference Result 268 states and 315 transitions. [2024-11-09 07:57:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:57:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,621 INFO L225 Difference]: With dead ends: 268 [2024-11-09 07:57:26,621 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 07:57:26,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:26,622 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 81 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 621 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 07:57:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2024-11-09 07:57:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.6587301587301588) internal successors, (209), 187 states have internal predecessors, (209), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 220 transitions. [2024-11-09 07:57:26,629 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 220 transitions. Word has length 18 [2024-11-09 07:57:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,629 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 220 transitions. [2024-11-09 07:57:26,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 220 transitions. [2024-11-09 07:57:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:57:26,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,630 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-11-09 07:57:26,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:57:26,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:26,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 751589882, now seen corresponding path program 1 times [2024-11-09 07:57:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351362165] [2024-11-09 07:57:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351362165] [2024-11-09 07:57:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351362165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87133807] [2024-11-09 07:57:26,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:57:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:57:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:57:26,695 INFO L87 Difference]: Start difference. First operand 189 states and 220 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,833 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2024-11-09 07:57:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:57:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:57:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,834 INFO L225 Difference]: With dead ends: 179 [2024-11-09 07:57:26,834 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 07:57:26,835 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-11-09 07:57:26,835 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 214 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 123 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 07:57:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-09 07:57:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 128 states have (on average 1.5546875) internal successors, (199), 177 states have internal predecessors, (199), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2024-11-09 07:57:26,839 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 20 [2024-11-09 07:57:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,839 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2024-11-09 07:57:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2024-11-09 07:57:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:57:26,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,840 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-11-09 07:57:26,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:57:26,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:26,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash 751589883, now seen corresponding path program 1 times [2024-11-09 07:57:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589066190] [2024-11-09 07:57:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589066190] [2024-11-09 07:57:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589066190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590445579] [2024-11-09 07:57:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:26,997 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,204 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2024-11-09 07:57:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:57:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,206 INFO L225 Difference]: With dead ends: 224 [2024-11-09 07:57:27,206 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 07:57:27,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:27,206 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 250 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 205 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 07:57:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2024-11-09 07:57:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 201 states have internal predecessors, (237), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2024-11-09 07:57:27,209 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 20 [2024-11-09 07:57:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2024-11-09 07:57:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2024-11-09 07:57:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:57:27,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,210 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-11-09 07:57:27,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:57:27,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:27,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash -570056512, now seen corresponding path program 1 times [2024-11-09 07:57:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747391464] [2024-11-09 07:57:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747391464] [2024-11-09 07:57:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747391464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266612670] [2024-11-09 07:57:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:57:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:57:27,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:57:27,261 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,372 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2024-11-09 07:57:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:57:27,372 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:57:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,373 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:57:27,373 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:57:27,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:27,374 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 211 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 286 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:57:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 202. [2024-11-09 07:57:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 152 states have (on average 1.5460526315789473) internal successors, (235), 200 states have internal predecessors, (235), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 245 transitions. [2024-11-09 07:57:27,379 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 245 transitions. Word has length 24 [2024-11-09 07:57:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,379 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 245 transitions. [2024-11-09 07:57:27,379 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 245 transitions. [2024-11-09 07:57:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:27,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,380 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] [2024-11-09 07:57:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:57:27,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 949739096, now seen corresponding path program 1 times [2024-11-09 07:57:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802933055] [2024-11-09 07:57:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802933055] [2024-11-09 07:57:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802933055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556259083] [2024-11-09 07:57:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:27,458 INFO L87 Difference]: Start difference. First operand 202 states and 245 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,618 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2024-11-09 07:57:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,620 INFO L225 Difference]: With dead ends: 201 [2024-11-09 07:57:27,620 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 07:57:27,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:27,621 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 477 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 07:57:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-09 07:57:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 152 states have (on average 1.5328947368421053) internal successors, (233), 199 states have internal predecessors, (233), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2024-11-09 07:57:27,625 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 23 [2024-11-09 07:57:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2024-11-09 07:57:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2024-11-09 07:57:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:27,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,627 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] [2024-11-09 07:57:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:57:27,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:27,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 949739097, now seen corresponding path program 1 times [2024-11-09 07:57:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825698830] [2024-11-09 07:57:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825698830] [2024-11-09 07:57:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825698830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184841740] [2024-11-09 07:57:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:27,782 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,959 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2024-11-09 07:57:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,960 INFO L225 Difference]: With dead ends: 200 [2024-11-09 07:57:27,961 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 07:57:27,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:27,963 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 2 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 466 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 07:57:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-09 07:57:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.519736842105263) internal successors, (231), 198 states have internal predecessors, (231), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 241 transitions. [2024-11-09 07:57:27,995 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 241 transitions. Word has length 23 [2024-11-09 07:57:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,995 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 241 transitions. [2024-11-09 07:57:27,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 241 transitions. [2024-11-09 07:57:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:57:27,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,998 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-11-09 07:57:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:57:27,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1333961702, now seen corresponding path program 1 times [2024-11-09 07:57:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342383736] [2024-11-09 07:57:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342383736] [2024-11-09 07:57:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342383736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318308004] [2024-11-09 07:57:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:28,234 INFO L87 Difference]: Start difference. First operand 200 states and 241 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-11-09 07:57:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:28,600 INFO L93 Difference]: Finished difference Result 199 states and 240 transitions. [2024-11-09 07:57:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-11-09 07:57:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:28,601 INFO L225 Difference]: With dead ends: 199 [2024-11-09 07:57:28,601 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 07:57:28,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-11-09 07:57:28,602 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 208 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:28,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 474 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 07:57:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-09 07:57:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.513157894736842) internal successors, (230), 197 states have internal predecessors, (230), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 240 transitions. [2024-11-09 07:57:28,607 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 240 transitions. Word has length 27 [2024-11-09 07:57:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 240 transitions. [2024-11-09 07:57:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-11-09 07:57:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 240 transitions. [2024-11-09 07:57:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:57:28,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:28,607 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-11-09 07:57:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:57:28,608 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1333961701, now seen corresponding path program 1 times [2024-11-09 07:57:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811676872] [2024-11-09 07:57:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811676872] [2024-11-09 07:57:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811676872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892194819] [2024-11-09 07:57:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:28,906 INFO L87 Difference]: Start difference. First operand 199 states and 240 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-11-09 07:57:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,414 INFO L93 Difference]: Finished difference Result 190 states and 231 transitions. [2024-11-09 07:57:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-11-09 07:57:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,416 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:57:29,416 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:57:29,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:57:29,416 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 235 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 489 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:57:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2024-11-09 07:57:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 179 states have internal predecessors, (211), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 221 transitions. [2024-11-09 07:57:29,420 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 221 transitions. Word has length 27 [2024-11-09 07:57:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,420 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 221 transitions. [2024-11-09 07:57:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-11-09 07:57:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 221 transitions. [2024-11-09 07:57:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:57:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,421 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, 1, 1, 1] [2024-11-09 07:57:29,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:57:29,422 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2092827832, now seen corresponding path program 1 times [2024-11-09 07:57:29,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206206998] [2024-11-09 07:57:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:29,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:29,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206206998] [2024-11-09 07:57:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206206998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:29,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:29,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142913446] [2024-11-09 07:57:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:29,451 INFO L87 Difference]: Start difference. First operand 181 states and 221 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,462 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2024-11-09 07:57:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:57:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,463 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:57:29,463 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:57:29,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:29,464 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:57:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2024-11-09 07:57:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 150 states have (on average 1.46) internal successors, (219), 185 states have internal predecessors, (219), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2024-11-09 07:57:29,467 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 30 [2024-11-09 07:57:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,467 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2024-11-09 07:57:29,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2024-11-09 07:57:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:57:29,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,467 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, 1, 1, 1] [2024-11-09 07:57:29,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:57:29,468 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:29,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2093310095, now seen corresponding path program 1 times [2024-11-09 07:57:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581969453] [2024-11-09 07:57:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581969453] [2024-11-09 07:57:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581969453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:29,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988744267] [2024-11-09 07:57:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:29,667 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,987 INFO L93 Difference]: Finished difference Result 277 states and 327 transitions. [2024-11-09 07:57:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:57:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,988 INFO L225 Difference]: With dead ends: 277 [2024-11-09 07:57:29,988 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 07:57:29,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:57:29,989 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 331 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 788 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 07:57:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 199. [2024-11-09 07:57:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 197 states have internal predecessors, (232), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2024-11-09 07:57:29,994 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 30 [2024-11-09 07:57:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,994 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2024-11-09 07:57:29,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2024-11-09 07:57:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:57:29,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,994 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, 1, 1, 1, 1] [2024-11-09 07:57:29,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:57:29,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1007751751, now seen corresponding path program 1 times [2024-11-09 07:57:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966381742] [2024-11-09 07:57:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966381742] [2024-11-09 07:57:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966381742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:30,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:30,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280935297] [2024-11-09 07:57:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:30,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:30,097 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:30,327 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2024-11-09 07:57:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:30,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:57:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:30,329 INFO L225 Difference]: With dead ends: 201 [2024-11-09 07:57:30,329 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 07:57:30,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:30,329 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 192 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:30,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 234 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 07:57:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-11-09 07:57:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 195 states have internal predecessors, (230), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2024-11-09 07:57:30,341 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 31 [2024-11-09 07:57:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:30,341 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2024-11-09 07:57:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2024-11-09 07:57:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:57:30,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:30,341 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, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:30,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:57:30,342 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:30,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1160575197, now seen corresponding path program 1 times [2024-11-09 07:57:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274334738] [2024-11-09 07:57:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274334738] [2024-11-09 07:57:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274334738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949826619] [2024-11-09 07:57:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:30,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:57:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:57:30,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:30,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:30,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:30,768 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 19 treesize of output 18 [2024-11-09 07:57:30,778 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 23 treesize of output 11 [2024-11-09 07:57:30,873 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 19 treesize of output 18 [2024-11-09 07:57:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:57:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:31,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:31,559 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 10 treesize of output 8 [2024-11-09 07:57:31,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-09 07:57:31,578 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 10 treesize of output 8 [2024-11-09 07:57:31,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949826619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:31,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2024-11-09 07:57:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745192824] [2024-11-09 07:57:31,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:31,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:57:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:31,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:57:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:31,603 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:32,141 INFO L93 Difference]: Finished difference Result 319 states and 373 transitions. [2024-11-09 07:57:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:57:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 07:57:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:32,143 INFO L225 Difference]: With dead ends: 319 [2024-11-09 07:57:32,143 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 07:57:32,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:57:32,144 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 573 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:32,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 838 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 07:57:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 225. [2024-11-09 07:57:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.431578947368421) internal successors, (272), 223 states have internal predecessors, (272), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2024-11-09 07:57:32,148 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 32 [2024-11-09 07:57:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:32,148 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2024-11-09 07:57:32,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2024-11-09 07:57:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:57:32,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:32,148 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:32,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:57:32,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 07:57:32,350 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:32,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1027465205, now seen corresponding path program 1 times [2024-11-09 07:57:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609561195] [2024-11-09 07:57:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609561195] [2024-11-09 07:57:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609561195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009338958] [2024-11-09 07:57:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:32,856 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:33,363 INFO L93 Difference]: Finished difference Result 287 states and 341 transitions. [2024-11-09 07:57:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 07:57:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:33,364 INFO L225 Difference]: With dead ends: 287 [2024-11-09 07:57:33,364 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 07:57:33,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:57:33,365 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 342 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:33,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 624 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 07:57:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 227. [2024-11-09 07:57:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.4196891191709844) internal successors, (274), 225 states have internal predecessors, (274), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 282 transitions. [2024-11-09 07:57:33,369 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 282 transitions. Word has length 35 [2024-11-09 07:57:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:33,369 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 282 transitions. [2024-11-09 07:57:33,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 282 transitions. [2024-11-09 07:57:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:57:33,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:33,370 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:33,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:57:33,370 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1027465206, now seen corresponding path program 1 times [2024-11-09 07:57:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:33,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064317975] [2024-11-09 07:57:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064317975] [2024-11-09 07:57:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064317975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:57:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804587368] [2024-11-09 07:57:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:33,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:57:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:33,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:57:33,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:57:33,617 INFO L87 Difference]: Start difference. First operand 227 states and 282 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,124 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2024-11-09 07:57:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 07:57:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,126 INFO L225 Difference]: With dead ends: 284 [2024-11-09 07:57:34,126 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 07:57:34,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:57:34,126 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 343 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 793 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 07:57:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2024-11-09 07:57:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 193 states have (on average 1.383419689119171) internal successors, (267), 223 states have internal predecessors, (267), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 275 transitions. [2024-11-09 07:57:34,130 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 275 transitions. Word has length 35 [2024-11-09 07:57:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 275 transitions. [2024-11-09 07:57:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 275 transitions. [2024-11-09 07:57:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:57:34,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:57:34,131 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1786594695, now seen corresponding path program 1 times [2024-11-09 07:57:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133680133] [2024-11-09 07:57:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133680133] [2024-11-09 07:57:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133680133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:34,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:34,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692622323] [2024-11-09 07:57:34,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:34,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:34,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:34,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:34,159 INFO L87 Difference]: Start difference. First operand 225 states and 275 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,175 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2024-11-09 07:57:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:34,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 07:57:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,176 INFO L225 Difference]: With dead ends: 224 [2024-11-09 07:57:34,176 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 07:57:34,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:34,176 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 07:57:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-09 07:57:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 222 states have internal predecessors, (263), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2024-11-09 07:57:34,180 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 36 [2024-11-09 07:57:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,180 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2024-11-09 07:57:34,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2024-11-09 07:57:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:57:34,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:57:34,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:34,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1093025040, now seen corresponding path program 1 times [2024-11-09 07:57:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087576227] [2024-11-09 07:57:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087576227] [2024-11-09 07:57:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087576227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469043494] [2024-11-09 07:57:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:34,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:34,290 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,434 INFO L93 Difference]: Finished difference Result 223 states and 269 transitions. [2024-11-09 07:57:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:57:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,436 INFO L225 Difference]: With dead ends: 223 [2024-11-09 07:57:34,436 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 07:57:34,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:34,437 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 422 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 07:57:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-09 07:57:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 221 states have internal predecessors, (262), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 269 transitions. [2024-11-09 07:57:34,445 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 269 transitions. Word has length 37 [2024-11-09 07:57:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,446 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 269 transitions. [2024-11-09 07:57:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 269 transitions. [2024-11-09 07:57:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:57:34,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:34,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:57:34,447 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1093025039, now seen corresponding path program 1 times [2024-11-09 07:57:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092339355] [2024-11-09 07:57:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092339355] [2024-11-09 07:57:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092339355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:34,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017885087] [2024-11-09 07:57:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:34,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:34,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:34,673 INFO L87 Difference]: Start difference. First operand 223 states and 269 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,920 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2024-11-09 07:57:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:34,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:57:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,921 INFO L225 Difference]: With dead ends: 222 [2024-11-09 07:57:34,921 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 07:57:34,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:34,922 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 419 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 07:57:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-09 07:57:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 220 states have internal predecessors, (261), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2024-11-09 07:57:34,927 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 37 [2024-11-09 07:57:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,927 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2024-11-09 07:57:34,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2024-11-09 07:57:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:34,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:34,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:57:34,928 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1749991584, now seen corresponding path program 1 times [2024-11-09 07:57:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038074225] [2024-11-09 07:57:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038074225] [2024-11-09 07:57:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038074225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463127228] [2024-11-09 07:57:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:35,043 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:35,316 INFO L93 Difference]: Finished difference Result 238 states and 286 transitions. [2024-11-09 07:57:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 07:57:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:35,321 INFO L225 Difference]: With dead ends: 238 [2024-11-09 07:57:35,321 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 07:57:35,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:35,322 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:35,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 644 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 07:57:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2024-11-09 07:57:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 202 states have (on average 1.3366336633663367) internal successors, (270), 229 states have internal predecessors, (270), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 277 transitions. [2024-11-09 07:57:35,334 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 277 transitions. Word has length 39 [2024-11-09 07:57:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:35,334 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 277 transitions. [2024-11-09 07:57:35,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 277 transitions. [2024-11-09 07:57:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:35,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:35,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:35,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:57:35,335 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1438394335, now seen corresponding path program 1 times [2024-11-09 07:57:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972285868] [2024-11-09 07:57:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972285868] [2024-11-09 07:57:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972285868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:57:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148337340] [2024-11-09 07:57:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:57:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:57:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:35,932 INFO L87 Difference]: Start difference. First operand 231 states and 277 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:36,674 INFO L93 Difference]: Finished difference Result 304 states and 349 transitions. [2024-11-09 07:57:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:57:36,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 07:57:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:36,677 INFO L225 Difference]: With dead ends: 304 [2024-11-09 07:57:36,677 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 07:57:36,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:57:36,678 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 375 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:36,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 943 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 07:57:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 232. [2024-11-09 07:57:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 203 states have (on average 1.3349753694581281) internal successors, (271), 230 states have internal predecessors, (271), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 278 transitions. [2024-11-09 07:57:36,682 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 278 transitions. Word has length 39 [2024-11-09 07:57:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:36,682 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 278 transitions. [2024-11-09 07:57:36,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 278 transitions. [2024-11-09 07:57:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:57:36,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:36,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:36,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:57:36,683 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:36,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1016229927, now seen corresponding path program 1 times [2024-11-09 07:57:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:36,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071066834] [2024-11-09 07:57:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071066834] [2024-11-09 07:57:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071066834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:57:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312394861] [2024-11-09 07:57:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:57:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:57:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:37,018 INFO L87 Difference]: Start difference. First operand 232 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,512 INFO L93 Difference]: Finished difference Result 317 states and 372 transitions. [2024-11-09 07:57:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:57:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 07:57:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,514 INFO L225 Difference]: With dead ends: 317 [2024-11-09 07:57:37,517 INFO L226 Difference]: Without dead ends: 317 [2024-11-09 07:57:37,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:57:37,518 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 425 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 703 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-09 07:57:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 234. [2024-11-09 07:57:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 232 states have internal predecessors, (273), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2024-11-09 07:57:37,526 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 38 [2024-11-09 07:57:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,526 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2024-11-09 07:57:37,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2024-11-09 07:57:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:37,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:37,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 07:57:37,527 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:37,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1684351743, now seen corresponding path program 1 times [2024-11-09 07:57:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784401745] [2024-11-09 07:57:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784401745] [2024-11-09 07:57:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784401745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:37,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749301438] [2024-11-09 07:57:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:37,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:37,605 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,662 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2024-11-09 07:57:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 07:57:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,664 INFO L225 Difference]: With dead ends: 243 [2024-11-09 07:57:37,664 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 07:57:37,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:37,665 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 07:57:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2024-11-09 07:57:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 206 states have (on average 1.3300970873786409) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-09 07:57:37,677 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 39 [2024-11-09 07:57:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-09 07:57:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-09 07:57:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:57:37,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:37,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 07:57:37,681 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:37,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1415813895, now seen corresponding path program 1 times [2024-11-09 07:57:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093822732] [2024-11-09 07:57:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093822732] [2024-11-09 07:57:37,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093822732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:37,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:37,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:37,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636347309] [2024-11-09 07:57:37,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:37,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:37,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:37,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:37,747 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,758 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2024-11-09 07:57:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 07:57:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,759 INFO L225 Difference]: With dead ends: 236 [2024-11-09 07:57:37,759 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 07:57:37,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:37,759 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 07:57:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-09 07:57:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.328502415458937) internal successors, (275), 234 states have internal predecessors, (275), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2024-11-09 07:57:37,766 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 41 [2024-11-09 07:57:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,767 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2024-11-09 07:57:37,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2024-11-09 07:57:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:57:37,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:57:37,768 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:37,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2133218631, now seen corresponding path program 1 times [2024-11-09 07:57:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737937033] [2024-11-09 07:57:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737937033] [2024-11-09 07:57:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737937033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:57:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876795092] [2024-11-09 07:57:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:38,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:57:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:38,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:57:38,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:38,106 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:38,539 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-09 07:57:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 07:57:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:38,541 INFO L225 Difference]: With dead ends: 235 [2024-11-09 07:57:38,541 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 07:57:38,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:57:38,541 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 178 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:38,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 653 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 07:57:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-09 07:57:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.3236714975845412) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-09 07:57:38,545 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 40 [2024-11-09 07:57:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:38,545 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-09 07:57:38,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-09 07:57:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:57:38,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:38,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 07:57:38,546 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2133218632, now seen corresponding path program 1 times [2024-11-09 07:57:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140260860] [2024-11-09 07:57:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140260860] [2024-11-09 07:57:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140260860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388983914] [2024-11-09 07:57:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:38,769 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:39,008 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-09 07:57:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 07:57:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:39,009 INFO L225 Difference]: With dead ends: 235 [2024-11-09 07:57:39,013 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 07:57:39,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:39,014 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 62 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:39,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 478 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 07:57:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-11-09 07:57:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.318840579710145) internal successors, (273), 232 states have internal predecessors, (273), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2024-11-09 07:57:39,021 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 40 [2024-11-09 07:57:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:39,021 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2024-11-09 07:57:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2024-11-09 07:57:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:57:39,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:39,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:39,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 07:57:39,022 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:39,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash -797431575, now seen corresponding path program 1 times [2024-11-09 07:57:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297564629] [2024-11-09 07:57:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297564629] [2024-11-09 07:57:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297564629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:39,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:57:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763499075] [2024-11-09 07:57:39,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:57:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:57:39,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:39,474 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:40,085 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2024-11-09 07:57:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:57:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:40,086 INFO L225 Difference]: With dead ends: 294 [2024-11-09 07:57:40,086 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 07:57:40,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:57:40,087 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 288 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:40,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 975 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 07:57:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 235. [2024-11-09 07:57:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 233 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2024-11-09 07:57:40,092 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 42 [2024-11-09 07:57:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:40,093 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2024-11-09 07:57:40,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2024-11-09 07:57:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:57:40,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:40,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 07:57:40,094 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash -419383679, now seen corresponding path program 1 times [2024-11-09 07:57:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631587323] [2024-11-09 07:57:40,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:40,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631587323] [2024-11-09 07:57:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631587323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792183374] [2024-11-09 07:57:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:40,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:40,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:40,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:40,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:57:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:40,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:57:40,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:40,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:40,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:40,486 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 21 treesize of output 20 [2024-11-09 07:57:40,493 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-11-09 07:57:40,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:40,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-09 07:57:40,573 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 21 treesize of output 20 [2024-11-09 07:57:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:40,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792183374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:41,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 9 [2024-11-09 07:57:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714302559] [2024-11-09 07:57:41,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:41,015 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:41,276 INFO L93 Difference]: Finished difference Result 299 states and 348 transitions. [2024-11-09 07:57:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:57:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:41,278 INFO L225 Difference]: With dead ends: 299 [2024-11-09 07:57:41,278 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 07:57:41,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:57:41,278 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:41,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 623 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 07:57:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 257. [2024-11-09 07:57:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 255 states have internal predecessors, (306), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2024-11-09 07:57:41,281 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 42 [2024-11-09 07:57:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2024-11-09 07:57:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2024-11-09 07:57:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:57:41,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:41,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:41,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 07:57:41,483 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 428821644, now seen corresponding path program 1 times [2024-11-09 07:57:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:41,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911401706] [2024-11-09 07:57:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:41,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911401706] [2024-11-09 07:57:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911401706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110035521] [2024-11-09 07:57:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:41,620 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:41,758 INFO L93 Difference]: Finished difference Result 268 states and 325 transitions. [2024-11-09 07:57:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:57:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:41,759 INFO L225 Difference]: With dead ends: 268 [2024-11-09 07:57:41,763 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 07:57:41,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:41,764 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:41,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 455 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 07:57:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2024-11-09 07:57:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 229 states have (on average 1.3275109170305677) internal successors, (304), 253 states have internal predecessors, (304), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 310 transitions. [2024-11-09 07:57:41,768 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 310 transitions. Word has length 43 [2024-11-09 07:57:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 310 transitions. [2024-11-09 07:57:41,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 310 transitions. [2024-11-09 07:57:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:57:41,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:41,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:57:41,770 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -115990869, now seen corresponding path program 1 times [2024-11-09 07:57:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475312373] [2024-11-09 07:57:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475312373] [2024-11-09 07:57:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475312373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557161177] [2024-11-09 07:57:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:41,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:41,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:57:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:41,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:57:41,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:57:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:42,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557161177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:42,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-09 07:57:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637028783] [2024-11-09 07:57:42,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:42,106 INFO L87 Difference]: Start difference. First operand 255 states and 310 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:42,208 INFO L93 Difference]: Finished difference Result 286 states and 341 transitions. [2024-11-09 07:57:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:57:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:57:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:42,209 INFO L225 Difference]: With dead ends: 286 [2024-11-09 07:57:42,209 INFO L226 Difference]: Without dead ends: 262 [2024-11-09 07:57:42,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:42,210 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:42,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-09 07:57:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-09 07:57:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 236 states have (on average 1.3177966101694916) internal successors, (311), 260 states have internal predecessors, (311), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2024-11-09 07:57:42,215 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 43 [2024-11-09 07:57:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2024-11-09 07:57:42,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2024-11-09 07:57:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:57:42,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:42,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:42,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:57:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:42,417 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1933063162, now seen corresponding path program 1 times [2024-11-09 07:57:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281244843] [2024-11-09 07:57:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281244843] [2024-11-09 07:57:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281244843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942189142] [2024-11-09 07:57:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:42,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:42,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:42,448 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:42,491 INFO L93 Difference]: Finished difference Result 267 states and 319 transitions. [2024-11-09 07:57:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 07:57:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:42,492 INFO L225 Difference]: With dead ends: 267 [2024-11-09 07:57:42,492 INFO L226 Difference]: Without dead ends: 267 [2024-11-09 07:57:42,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:42,492 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:42,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 177 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-09 07:57:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2024-11-09 07:57:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 259 states have internal predecessors, (308), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2024-11-09 07:57:42,496 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 44 [2024-11-09 07:57:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:42,496 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2024-11-09 07:57:42,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2024-11-09 07:57:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:57:42,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:42,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 07:57:42,497 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -755092251, now seen corresponding path program 1 times [2024-11-09 07:57:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425123232] [2024-11-09 07:57:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425123232] [2024-11-09 07:57:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425123232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:42,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523502965] [2024-11-09 07:57:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:42,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:42,760 INFO L87 Difference]: Start difference. First operand 261 states and 313 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:43,183 INFO L93 Difference]: Finished difference Result 277 states and 321 transitions. [2024-11-09 07:57:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:43,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:57:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:43,185 INFO L225 Difference]: With dead ends: 277 [2024-11-09 07:57:43,185 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 07:57:43,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:57:43,187 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 344 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:43,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 510 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 07:57:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2024-11-09 07:57:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 259 states have internal predecessors, (307), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 312 transitions. [2024-11-09 07:57:43,191 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 312 transitions. Word has length 43 [2024-11-09 07:57:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 312 transitions. [2024-11-09 07:57:43,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 312 transitions. [2024-11-09 07:57:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:57:43,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:43,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 07:57:43,194 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:43,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -755092250, now seen corresponding path program 1 times [2024-11-09 07:57:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:43,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396590588] [2024-11-09 07:57:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396590588] [2024-11-09 07:57:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396590588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:43,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807835189] [2024-11-09 07:57:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:43,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:43,495 INFO L87 Difference]: Start difference. First operand 261 states and 312 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:43,851 INFO L93 Difference]: Finished difference Result 274 states and 318 transitions. [2024-11-09 07:57:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:57:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:43,852 INFO L225 Difference]: With dead ends: 274 [2024-11-09 07:57:43,852 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 07:57:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:57:43,853 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 239 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:43,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 538 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 07:57:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2024-11-09 07:57:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 259 states have internal predecessors, (304), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2024-11-09 07:57:43,864 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 43 [2024-11-09 07:57:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:43,864 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2024-11-09 07:57:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2024-11-09 07:57:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:57:43,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:43,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 07:57:43,865 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash 235650010, now seen corresponding path program 1 times [2024-11-09 07:57:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467873795] [2024-11-09 07:57:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467873795] [2024-11-09 07:57:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467873795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:44,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308131122] [2024-11-09 07:57:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:44,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:44,070 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:44,402 INFO L93 Difference]: Finished difference Result 278 states and 321 transitions. [2024-11-09 07:57:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:44,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 07:57:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:44,403 INFO L225 Difference]: With dead ends: 278 [2024-11-09 07:57:44,403 INFO L226 Difference]: Without dead ends: 278 [2024-11-09 07:57:44,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:44,404 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 74 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:44,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 590 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-09 07:57:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 260. [2024-11-09 07:57:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 258 states have internal predecessors, (302), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 307 transitions. [2024-11-09 07:57:44,407 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 307 transitions. Word has length 47 [2024-11-09 07:57:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:44,407 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 307 transitions. [2024-11-09 07:57:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 307 transitions. [2024-11-09 07:57:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:57:44,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:44,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:44,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 07:57:44,408 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:44,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1238044324, now seen corresponding path program 1 times [2024-11-09 07:57:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141560009] [2024-11-09 07:57:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141560009] [2024-11-09 07:57:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141560009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57762083] [2024-11-09 07:57:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:44,435 INFO L87 Difference]: Start difference. First operand 260 states and 307 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:44,443 INFO L93 Difference]: Finished difference Result 313 states and 375 transitions. [2024-11-09 07:57:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:44,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 07:57:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:44,444 INFO L225 Difference]: With dead ends: 313 [2024-11-09 07:57:44,444 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 07:57:44,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:44,444 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:44,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 07:57:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2024-11-09 07:57:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.3125) internal successors, (357), 295 states have internal predecessors, (357), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 362 transitions. [2024-11-09 07:57:44,448 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 362 transitions. Word has length 47 [2024-11-09 07:57:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:44,448 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 362 transitions. [2024-11-09 07:57:44,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 362 transitions. [2024-11-09 07:57:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:57:44,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:44,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 07:57:44,449 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:44,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1237621643, now seen corresponding path program 1 times [2024-11-09 07:57:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975521573] [2024-11-09 07:57:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975521573] [2024-11-09 07:57:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975521573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:44,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:57:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097610342] [2024-11-09 07:57:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:44,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:44,515 INFO L87 Difference]: Start difference. First operand 297 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:44,594 INFO L93 Difference]: Finished difference Result 247 states and 280 transitions. [2024-11-09 07:57:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 07:57:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:44,596 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:57:44,596 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:57:44,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:44,596 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:44,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:57:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-09 07:57:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 223 states have (on average 1.2376681614349776) internal successors, (276), 245 states have internal predecessors, (276), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 280 transitions. [2024-11-09 07:57:44,599 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 280 transitions. Word has length 47 [2024-11-09 07:57:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:44,600 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 280 transitions. [2024-11-09 07:57:44,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 280 transitions. [2024-11-09 07:57:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:57:44,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:44,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 07:57:44,601 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 519496652, now seen corresponding path program 1 times [2024-11-09 07:57:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428820428] [2024-11-09 07:57:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:57:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428820428] [2024-11-09 07:57:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428820428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:57:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270815240] [2024-11-09 07:57:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:57:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:57:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:57:44,787 INFO L87 Difference]: Start difference. First operand 247 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:45,116 INFO L93 Difference]: Finished difference Result 231 states and 261 transitions. [2024-11-09 07:57:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:57:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 07:57:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:45,117 INFO L225 Difference]: With dead ends: 231 [2024-11-09 07:57:45,117 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 07:57:45,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:57:45,118 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 392 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:45,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 650 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 07:57:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2024-11-09 07:57:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 200 states have (on average 1.255) internal successors, (251), 222 states have internal predecessors, (251), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 255 transitions. [2024-11-09 07:57:45,121 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 255 transitions. Word has length 50 [2024-11-09 07:57:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:45,121 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 255 transitions. [2024-11-09 07:57:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 255 transitions. [2024-11-09 07:57:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:57:45,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:45,122 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, 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-11-09 07:57:45,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 07:57:45,122 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:45,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1106827368, now seen corresponding path program 1 times [2024-11-09 07:57:45,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796445777] [2024-11-09 07:57:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796445777] [2024-11-09 07:57:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796445777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:45,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:45,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747836831] [2024-11-09 07:57:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:45,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:45,231 INFO L87 Difference]: Start difference. First operand 224 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:45,315 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2024-11-09 07:57:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 07:57:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:45,316 INFO L225 Difference]: With dead ends: 238 [2024-11-09 07:57:45,316 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 07:57:45,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:45,317 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:45,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 493 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 07:57:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 227. [2024-11-09 07:57:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.251231527093596) internal successors, (254), 225 states have internal predecessors, (254), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 258 transitions. [2024-11-09 07:57:45,320 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 258 transitions. Word has length 52 [2024-11-09 07:57:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 258 transitions. [2024-11-09 07:57:45,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 258 transitions. [2024-11-09 07:57:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:57:45,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:45,321 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, 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, 1] [2024-11-09 07:57:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 07:57:45,321 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-09 07:57:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1922941171, now seen corresponding path program 1 times [2024-11-09 07:57:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550633945] [2024-11-09 07:57:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550633945] [2024-11-09 07:57:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550633945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409813824] [2024-11-09 07:57:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:46,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:46,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:46,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:57:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:46,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 07:57:46,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:46,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:57:46,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:46,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:46,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:46,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:57:46,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:46,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:46,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:46,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:46,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:46,437 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 48 treesize of output 43 [2024-11-09 07:57:46,446 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 24 treesize of output 11 [2024-11-09 07:57:46,625 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:46,625 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 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-09 07:57:46,646 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:46,647 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:57:46,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:46,802 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 48 treesize of output 43 [2024-11-09 07:57:46,809 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 24 treesize of output 11 [2024-11-09 07:57:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:47,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:47,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-09 07:57:47,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1517) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1518))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1522)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:57:47,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1518))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1522)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-09 07:57:47,286 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_#t~malloc10#1.offset| Int) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1517) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1521) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1518))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1522)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) is different from false [2024-11-09 07:57:51,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:51,639 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2024-11-09 07:57:51,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 164 [2024-11-09 07:57:51,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-09 07:57:51,653 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 44 treesize of output 36 [2024-11-09 07:57:51,665 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,667 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-09 07:57:51,667 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-09 07:57:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:56,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409813824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:56,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:56,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 37 [2024-11-09 07:57:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842886011] [2024-11-09 07:57:56,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:56,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:57:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:57:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=883, Unknown=22, NotChecked=260, Total=1332 [2024-11-09 07:57:56,108 INFO L87 Difference]: Start difference. First operand 227 states and 258 transitions. Second operand has 37 states, 37 states have (on average 3.891891891891892) internal successors, (144), 37 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-11-09 07:58:00,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:04,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:08,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:21,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:29,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:33,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:37,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:41,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:45,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:49,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:58:53,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]