./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:28:46,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:28:46,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:28:46,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:28:46,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:28:46,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:28:46,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:28:46,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:28:46,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:28:46,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:28:46,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:28:46,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:28:46,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:28:46,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:28:46,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:28:46,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:28:46,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:28:46,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:28:46,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:28:46,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:28:46,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:28:46,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:28:46,521 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:28:46,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:28:46,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:28:46,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:28:46,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:28:46,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:28:46,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:28:46,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:28:46,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:28:46,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:28:46,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:28:46,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:28:46,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:28:46,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:28:46,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:28:46,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:28:46,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:28:46,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:28:46,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:28:46,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:28:46,526 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2024-11-17 00:28:46,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:28:46,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:28:46,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:28:46,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:28:46,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:28:46,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2024-11-17 00:28:48,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:28:48,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:28:48,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2024-11-17 00:28:48,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae19ec7e/dea775cffbf64cbdab93eb129c699566/FLAGec372b4fa [2024-11-17 00:28:48,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae19ec7e/dea775cffbf64cbdab93eb129c699566 [2024-11-17 00:28:48,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:28:48,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:28:48,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:28:48,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:28:48,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:28:48,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:28:48" (1/1) ... [2024-11-17 00:28:48,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7b8ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:48, skipping insertion in model container [2024-11-17 00:28:48,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:28:48" (1/1) ... [2024-11-17 00:28:48,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:28:48,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:28:48,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:28:48,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:28:49,015 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:28:49,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49 WrapperNode [2024-11-17 00:28:49,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:28:49,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:28:49,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:28:49,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:28:49,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,065 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2024-11-17 00:28:49,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:28:49,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:28:49,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:28:49,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:28:49,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,102 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-17 00:28:49,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:28:49,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:28:49,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:28:49,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:28:49,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (1/1) ... [2024-11-17 00:28:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:28:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:28:49,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:28:49,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:28:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:28:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:28:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:28:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:28:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:28:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:28:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:28:49,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:28:49,399 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:28:49,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:28:49,799 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-17 00:28:49,800 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:28:49,815 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:28:49,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:28:49,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:28:49 BoogieIcfgContainer [2024-11-17 00:28:49,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:28:49,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:28:49,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:28:49,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:28:49,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:28:48" (1/3) ... [2024-11-17 00:28:49,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682f1b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:28:49, skipping insertion in model container [2024-11-17 00:28:49,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:49" (2/3) ... [2024-11-17 00:28:49,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682f1b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:28:49, skipping insertion in model container [2024-11-17 00:28:49,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:28:49" (3/3) ... [2024-11-17 00:28:49,829 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2024-11-17 00:28:49,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:28:49,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-17 00:28:49,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:28:49,903 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;@8bb33a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:28:49,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-17 00:28:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:28:49,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:49,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:28:49,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121949, now seen corresponding path program 1 times [2024-11-17 00:28:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82759546] [2024-11-17 00:28:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:50,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82759546] [2024-11-17 00:28:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82759546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:50,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:50,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270876564] [2024-11-17 00:28:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:50,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:28:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:28:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:28:50,113 INFO L87 Difference]: Start difference. First operand has 140 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:50,133 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2024-11-17 00:28:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:28:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:28:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:50,142 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:28:50,142 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 00:28:50,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:28:50,146 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:50,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:28:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 00:28:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-17 00:28:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 136 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2024-11-17 00:28:50,181 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 6 [2024-11-17 00:28:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:50,182 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2024-11-17 00:28:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2024-11-17 00:28:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:28:50,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:50,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:28:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:28:50,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121980, now seen corresponding path program 1 times [2024-11-17 00:28:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994078426] [2024-11-17 00:28:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994078426] [2024-11-17 00:28:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994078426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:50,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:50,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627996140] [2024-11-17 00:28:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,319 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:50,488 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2024-11-17 00:28:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:50,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:28:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:50,490 INFO L225 Difference]: With dead ends: 145 [2024-11-17 00:28:50,492 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 00:28:50,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,493 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:50,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 00:28:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-11-17 00:28:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.8875) internal successors, (151), 138 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-17 00:28:50,510 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 6 [2024-11-17 00:28:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:50,511 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-17 00:28:50,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-17 00:28:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:28:50,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:50,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:28:50,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:28:50,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121981, now seen corresponding path program 1 times [2024-11-17 00:28:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798131798] [2024-11-17 00:28:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798131798] [2024-11-17 00:28:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798131798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:50,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473551568] [2024-11-17 00:28:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,657 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:50,801 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2024-11-17 00:28:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:28:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:50,803 INFO L225 Difference]: With dead ends: 137 [2024-11-17 00:28:50,805 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 00:28:50,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,807 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:50,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 00:28:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-17 00:28:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-17 00:28:50,824 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2024-11-17 00:28:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:50,824 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-17 00:28:50,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-17 00:28:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:28:50,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:50,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:28:50,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:50,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -335018088, now seen corresponding path program 1 times [2024-11-17 00:28:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519961832] [2024-11-17 00:28:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:50,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519961832] [2024-11-17 00:28:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519961832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996894455] [2024-11-17 00:28:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:50,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,864 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:50,968 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2024-11-17 00:28:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:28:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:50,970 INFO L225 Difference]: With dead ends: 187 [2024-11-17 00:28:50,971 INFO L226 Difference]: Without dead ends: 185 [2024-11-17 00:28:50,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:50,972 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:50,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 194 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-17 00:28:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 140. [2024-11-17 00:28:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-17 00:28:51,003 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 7 [2024-11-17 00:28:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-17 00:28:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-17 00:28:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:28:51,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:51,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:51,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:28:51,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:51,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:51,006 INFO L85 PathProgramCache]: Analyzing trace with hash -335013544, now seen corresponding path program 1 times [2024-11-17 00:28:51,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:51,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267394690] [2024-11-17 00:28:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:51,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267394690] [2024-11-17 00:28:51,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267394690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:28:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766209305] [2024-11-17 00:28:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:51,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:51,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,044 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:51,096 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-17 00:28:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:51,096 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:28:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:51,097 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:28:51,097 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 00:28:51,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,099 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:51,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:28:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 00:28:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-17 00:28:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.7840909090909092) internal successors, (157), 144 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-17 00:28:51,105 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 7 [2024-11-17 00:28:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:51,106 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-17 00:28:51,106 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-17 00:28:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:28:51,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:51,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:51,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:28:51,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1158769457, now seen corresponding path program 1 times [2024-11-17 00:28:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022508762] [2024-11-17 00:28:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022508762] [2024-11-17 00:28:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022508762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:51,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179158811] [2024-11-17 00:28:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:51,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:51,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,205 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:51,286 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2024-11-17 00:28:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:28:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:51,290 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:28:51,291 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 00:28:51,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,292 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 19 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:51,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 179 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 00:28:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-17 00:28:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2024-11-17 00:28:51,300 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 11 [2024-11-17 00:28:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2024-11-17 00:28:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2024-11-17 00:28:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:28:51,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:51,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:51,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:28:51,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1158769458, now seen corresponding path program 1 times [2024-11-17 00:28:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409380260] [2024-11-17 00:28:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409380260] [2024-11-17 00:28:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409380260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598688298] [2024-11-17 00:28:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:51,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,409 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:51,491 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2024-11-17 00:28:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:51,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:28:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:51,493 INFO L225 Difference]: With dead ends: 138 [2024-11-17 00:28:51,493 INFO L226 Difference]: Without dead ends: 138 [2024-11-17 00:28:51,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:51,494 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:51,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 193 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-17 00:28:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-17 00:28:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-17 00:28:51,501 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 11 [2024-11-17 00:28:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:51,501 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-17 00:28:51,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-17 00:28:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:28:51,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:51,506 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:28:51,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1098958627, now seen corresponding path program 1 times [2024-11-17 00:28:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674931103] [2024-11-17 00:28:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674931103] [2024-11-17 00:28:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674931103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:28:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756665362] [2024-11-17 00:28:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:51,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:28:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:28:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:28:51,599 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:51,705 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2024-11-17 00:28:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:28:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:28:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:51,706 INFO L225 Difference]: With dead ends: 211 [2024-11-17 00:28:51,706 INFO L226 Difference]: Without dead ends: 211 [2024-11-17 00:28:51,707 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-17 00:28:51,708 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:51,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-17 00:28:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 138. [2024-11-17 00:28:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.6818181818181819) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2024-11-17 00:28:51,717 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 19 [2024-11-17 00:28:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2024-11-17 00:28:51,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2024-11-17 00:28:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:28:51,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:51,718 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:51,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:28:51,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1098963171, now seen corresponding path program 1 times [2024-11-17 00:28:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121853189] [2024-11-17 00:28:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:51,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:51,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121853189] [2024-11-17 00:28:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121853189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:51,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:28:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39838466] [2024-11-17 00:28:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:28:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:28:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:51,845 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:52,033 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-17 00:28:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:28:52,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:28:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:52,035 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:28:52,035 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:28:52,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:52,036 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 40 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:52,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:28:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-17 00:28:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-17 00:28:52,040 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 19 [2024-11-17 00:28:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:52,040 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-17 00:28:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-17 00:28:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:28:52,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:52,042 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:28:52,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1098963172, now seen corresponding path program 1 times [2024-11-17 00:28:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072294122] [2024-11-17 00:28:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072294122] [2024-11-17 00:28:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072294122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:28:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327333455] [2024-11-17 00:28:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:28:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:28:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:28:52,170 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:52,347 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2024-11-17 00:28:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:28:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:28:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:52,349 INFO L225 Difference]: With dead ends: 197 [2024-11-17 00:28:52,349 INFO L226 Difference]: Without dead ends: 197 [2024-11-17 00:28:52,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:52,350 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 81 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:52,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 196 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-17 00:28:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2024-11-17 00:28:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 173 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2024-11-17 00:28:52,355 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 19 [2024-11-17 00:28:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2024-11-17 00:28:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2024-11-17 00:28:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:28:52,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:52,357 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] [2024-11-17 00:28:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:28:52,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -854980246, now seen corresponding path program 1 times [2024-11-17 00:28:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800318258] [2024-11-17 00:28:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800318258] [2024-11-17 00:28:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800318258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:28:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233747083] [2024-11-17 00:28:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:28:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:28:52,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:52,440 INFO L87 Difference]: Start difference. First operand 174 states and 217 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:52,546 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2024-11-17 00:28:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:28:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:28:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:52,548 INFO L225 Difference]: With dead ends: 199 [2024-11-17 00:28:52,548 INFO L226 Difference]: Without dead ends: 199 [2024-11-17 00:28:52,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:28:52,549 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 83 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:52,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 269 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-17 00:28:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 175. [2024-11-17 00:28:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.614814814814815) internal successors, (218), 174 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2024-11-17 00:28:52,553 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 24 [2024-11-17 00:28:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:52,556 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2024-11-17 00:28:52,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2024-11-17 00:28:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:28:52,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:52,557 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] [2024-11-17 00:28:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:28:52,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:52,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -851717174, now seen corresponding path program 1 times [2024-11-17 00:28:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506746567] [2024-11-17 00:28:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506746567] [2024-11-17 00:28:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506746567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:28:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819343339] [2024-11-17 00:28:52,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:28:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:28:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:28:52,797 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:52,917 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2024-11-17 00:28:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:28:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:28:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:52,920 INFO L225 Difference]: With dead ends: 188 [2024-11-17 00:28:52,920 INFO L226 Difference]: Without dead ends: 188 [2024-11-17 00:28:52,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:28:52,920 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:52,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 369 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:52,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-17 00:28:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2024-11-17 00:28:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 182 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2024-11-17 00:28:52,926 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 227 transitions. Word has length 24 [2024-11-17 00:28:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:52,926 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 227 transitions. [2024-11-17 00:28:52,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 227 transitions. [2024-11-17 00:28:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:28:52,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:52,927 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] [2024-11-17 00:28:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:28:52,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -648189399, now seen corresponding path program 1 times [2024-11-17 00:28:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951726073] [2024-11-17 00:28:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951726073] [2024-11-17 00:28:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951726073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:28:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915789344] [2024-11-17 00:28:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:53,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:28:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:53,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:28:53,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:28:53,504 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:53,938 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-17 00:28:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:28:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:28:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:53,939 INFO L225 Difference]: With dead ends: 203 [2024-11-17 00:28:53,939 INFO L226 Difference]: Without dead ends: 203 [2024-11-17 00:28:53,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:28:53,940 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 37 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:53,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 396 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:28:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-17 00:28:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-17 00:28:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 191 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2024-11-17 00:28:53,944 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 29 [2024-11-17 00:28:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2024-11-17 00:28:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2024-11-17 00:28:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:28:53,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:53,953 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] [2024-11-17 00:28:53,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:28:53,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:53,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash -648189400, now seen corresponding path program 1 times [2024-11-17 00:28:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071371751] [2024-11-17 00:28:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:54,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:54,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071371751] [2024-11-17 00:28:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071371751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:28:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388811494] [2024-11-17 00:28:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:28:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:28:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:28:54,303 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:54,592 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2024-11-17 00:28:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:28:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:28:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:54,593 INFO L225 Difference]: With dead ends: 204 [2024-11-17 00:28:54,593 INFO L226 Difference]: Without dead ends: 204 [2024-11-17 00:28:54,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:28:54,594 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 46 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:54,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-17 00:28:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-11-17 00:28:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 191 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2024-11-17 00:28:54,615 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 29 [2024-11-17 00:28:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:54,615 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2024-11-17 00:28:54,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2024-11-17 00:28:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:28:54,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:54,617 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] [2024-11-17 00:28:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:28:54,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:54,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -139824577, now seen corresponding path program 1 times [2024-11-17 00:28:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627107166] [2024-11-17 00:28:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627107166] [2024-11-17 00:28:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627107166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:28:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137811224] [2024-11-17 00:28:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:28:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:28:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:28:54,810 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:54,996 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2024-11-17 00:28:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:28:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-17 00:28:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:54,998 INFO L225 Difference]: With dead ends: 194 [2024-11-17 00:28:54,998 INFO L226 Difference]: Without dead ends: 194 [2024-11-17 00:28:54,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:28:54,999 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 15 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:54,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 506 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-17 00:28:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-17 00:28:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5526315789473684) internal successors, (236), 191 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2024-11-17 00:28:55,003 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 31 [2024-11-17 00:28:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2024-11-17 00:28:55,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2024-11-17 00:28:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:28:55,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:55,003 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] [2024-11-17 00:28:55,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:28:55,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:55,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash -139756026, now seen corresponding path program 1 times [2024-11-17 00:28:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864634039] [2024-11-17 00:28:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864634039] [2024-11-17 00:28:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864634039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:28:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247080419] [2024-11-17 00:28:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:28:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:28:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:28:55,250 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:55,444 INFO L93 Difference]: Finished difference Result 205 states and 249 transitions. [2024-11-17 00:28:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:28:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-17 00:28:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:55,446 INFO L225 Difference]: With dead ends: 205 [2024-11-17 00:28:55,446 INFO L226 Difference]: Without dead ends: 205 [2024-11-17 00:28:55,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:28:55,447 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 36 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:55,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 463 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-17 00:28:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2024-11-17 00:28:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 154 states have (on average 1.5454545454545454) internal successors, (238), 193 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 238 transitions. [2024-11-17 00:28:55,451 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 238 transitions. Word has length 31 [2024-11-17 00:28:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:55,451 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 238 transitions. [2024-11-17 00:28:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2024-11-17 00:28:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:28:55,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:55,454 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-17 00:28:55,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:28:55,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:55,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -37469531, now seen corresponding path program 1 times [2024-11-17 00:28:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960694671] [2024-11-17 00:28:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960694671] [2024-11-17 00:28:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960694671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:28:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455938022] [2024-11-17 00:28:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:28:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:28:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:28:55,731 INFO L87 Difference]: Start difference. First operand 194 states and 238 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:56,007 INFO L93 Difference]: Finished difference Result 197 states and 241 transitions. [2024-11-17 00:28:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:28:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-17 00:28:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:56,009 INFO L225 Difference]: With dead ends: 197 [2024-11-17 00:28:56,009 INFO L226 Difference]: Without dead ends: 197 [2024-11-17 00:28:56,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:28:56,010 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:56,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 531 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-17 00:28:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-17 00:28:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.5419354838709678) internal successors, (239), 194 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 239 transitions. [2024-11-17 00:28:56,015 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 239 transitions. Word has length 32 [2024-11-17 00:28:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:56,015 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 239 transitions. [2024-11-17 00:28:56,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 239 transitions. [2024-11-17 00:28:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:28:56,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:56,016 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] [2024-11-17 00:28:56,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:28:56,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1161555484, now seen corresponding path program 1 times [2024-11-17 00:28:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240314056] [2024-11-17 00:28:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:28:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240314056] [2024-11-17 00:28:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240314056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:28:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348656669] [2024-11-17 00:28:56,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:28:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:28:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:28:56,071 INFO L87 Difference]: Start difference. First operand 195 states and 239 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:56,242 INFO L93 Difference]: Finished difference Result 263 states and 330 transitions. [2024-11-17 00:28:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:28:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 00:28:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:56,245 INFO L225 Difference]: With dead ends: 263 [2024-11-17 00:28:56,245 INFO L226 Difference]: Without dead ends: 263 [2024-11-17 00:28:56,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:56,246 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:56,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 257 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:28:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-17 00:28:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 201. [2024-11-17 00:28:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 200 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2024-11-17 00:28:56,251 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 33 [2024-11-17 00:28:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:56,251 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2024-11-17 00:28:56,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2024-11-17 00:28:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:28:56,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:56,252 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] [2024-11-17 00:28:56,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:28:56,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:28:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1261079570, now seen corresponding path program 1 times [2024-11-17 00:28:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:56,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109074205] [2024-11-17 00:28:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109074205] [2024-11-17 00:28:56,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109074205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:28:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212696462] [2024-11-17 00:28:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:28:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:28:56,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:28:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:28:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:56,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-17 00:28:56,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:28:57,038 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-17 00:28:57,058 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-17 00:28:57,098 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-17 00:28:57,103 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-17 00:28:57,168 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:28:57,169 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-17 00:28:57,200 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:28:57,201 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-17 00:28:57,294 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 35 treesize of output 23 [2024-11-17 00:28:57,316 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:28:57,317 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 28 treesize of output 31 [2024-11-17 00:28:57,609 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-17 00:28:57,897 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-17 00:28:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 99 [2024-11-17 00:28:57,975 INFO L349 Elim1Store]: treesize reduction 16, result has 78.1 percent of original size [2024-11-17 00:28:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 114 [2024-11-17 00:28:58,037 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-17 00:28:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2024-11-17 00:28:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:28:58,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:28:58,460 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 10 treesize of output 8 [2024-11-17 00:28:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-17 00:28:58,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse2 (not .cse0))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 v_arrayElimCell_20) 0) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse2 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 v_arrayElimCell_20) 0) 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_ArrVal_419 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (select (store v_ArrVal_419 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_419) .cse4) 0) 0) (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|)))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse5 v_arrayElimCell_20) 0) 0) (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse2 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))))) is different from false [2024-11-17 00:29:03,268 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 15 treesize of output 13 [2024-11-17 00:29:03,270 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 102 treesize of output 98 [2024-11-17 00:29:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212696462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:03,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:03,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 39 [2024-11-17 00:29:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039109089] [2024-11-17 00:29:03,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:03,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-17 00:29:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-17 00:29:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1249, Unknown=5, NotChecked=72, Total=1482 [2024-11-17 00:29:03,281 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:04,534 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2024-11-17 00:29:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:29:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 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-17 00:29:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:04,535 INFO L225 Difference]: With dead ends: 209 [2024-11-17 00:29:04,536 INFO L226 Difference]: Without dead ends: 209 [2024-11-17 00:29:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=235, Invalid=1744, Unknown=5, NotChecked=86, Total=2070 [2024-11-17 00:29:04,537 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1601 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1428 Invalid, 0 Unknown, 80 Unchecked, 0.9s Time] [2024-11-17 00:29:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-17 00:29:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2024-11-17 00:29:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.532934131736527) internal successors, (256), 204 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2024-11-17 00:29:04,541 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 37 [2024-11-17 00:29:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:04,542 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2024-11-17 00:29:04,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2024-11-17 00:29:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:29:04,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:04,543 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:04,558 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-17 00:29:04,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:04,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -105171399, now seen corresponding path program 1 times [2024-11-17 00:29:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186954179] [2024-11-17 00:29:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186954179] [2024-11-17 00:29:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186954179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916742316] [2024-11-17 00:29:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:04,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:04,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:29:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:05,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:29:05,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:05,157 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-17 00:29:05,218 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-17 00:29:05,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:05,248 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 00:29:05,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:29:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:05,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916742316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:10,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-11-17 00:29:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846733077] [2024-11-17 00:29:10,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:10,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:29:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:29:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2024-11-17 00:29:10,009 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:10,635 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2024-11-17 00:29:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:29:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 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-17 00:29:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:10,636 INFO L225 Difference]: With dead ends: 229 [2024-11-17 00:29:10,636 INFO L226 Difference]: Without dead ends: 229 [2024-11-17 00:29:10,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=198, Invalid=731, Unknown=1, NotChecked=0, Total=930 [2024-11-17 00:29:10,637 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 155 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:10,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 821 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:29:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-17 00:29:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2024-11-17 00:29:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.526946107784431) internal successors, (255), 204 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2024-11-17 00:29:10,641 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 38 [2024-11-17 00:29:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:10,642 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2024-11-17 00:29:10,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2024-11-17 00:29:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:29:10,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:10,643 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:10,661 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-17 00:29:10,846 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,SelfDestructingSolverStorable19 [2024-11-17 00:29:10,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:10,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -105171398, now seen corresponding path program 1 times [2024-11-17 00:29:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:10,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467663804] [2024-11-17 00:29:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467663804] [2024-11-17 00:29:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467663804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602608043] [2024-11-17 00:29:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:11,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:11,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:29:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:11,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 00:29:11,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:11,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:29:11,445 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-17 00:29:11,452 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-17 00:29:11,479 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2024-11-17 00:29:11,486 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 35 treesize of output 11 [2024-11-17 00:29:11,590 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 25 treesize of output 13 [2024-11-17 00:29:11,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:29:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:11,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:29:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602608043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:11,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:29:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2024-11-17 00:29:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390965140] [2024-11-17 00:29:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:11,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:29:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:29:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:29:11,607 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:11,812 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2024-11-17 00:29:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:29:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 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-17 00:29:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:11,814 INFO L225 Difference]: With dead ends: 228 [2024-11-17 00:29:11,814 INFO L226 Difference]: Without dead ends: 228 [2024-11-17 00:29:11,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:29:11,816 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 77 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:11,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 475 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-17 00:29:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 205. [2024-11-17 00:29:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 204 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 254 transitions. [2024-11-17 00:29:11,821 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 254 transitions. Word has length 38 [2024-11-17 00:29:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:11,821 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 254 transitions. [2024-11-17 00:29:11,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 254 transitions. [2024-11-17 00:29:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:29:11,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:11,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:11,838 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-17 00:29:12,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:12,027 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -716759356, now seen corresponding path program 1 times [2024-11-17 00:29:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256125285] [2024-11-17 00:29:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256125285] [2024-11-17 00:29:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256125285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834676185] [2024-11-17 00:29:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:12,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:12,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:29:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:12,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 00:29:12,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:12,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:12,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:12,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2024-11-17 00:29:13,022 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item2~0#1.base_28| Int) (|v_ULTIMATE.start_main_~data~0#1.base_48| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_28|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_48| 0) |v_ULTIMATE.start_main_~item2~0#1.base_28| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_28| 1) |v_ULTIMATE.start_main_~data~0#1.base_48|) 0))) is different from true [2024-11-17 00:29:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:29:13,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:13,179 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 48 treesize of output 44 [2024-11-17 00:29:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:17,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834676185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:17,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:17,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 29 [2024-11-17 00:29:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893662369] [2024-11-17 00:29:17,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:17,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-17 00:29:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 00:29:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=721, Unknown=2, NotChecked=54, Total=870 [2024-11-17 00:29:17,846 INFO L87 Difference]: Start difference. First operand 205 states and 254 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:19,112 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2024-11-17 00:29:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:29:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 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-17 00:29:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:19,114 INFO L225 Difference]: With dead ends: 208 [2024-11-17 00:29:19,114 INFO L226 Difference]: Without dead ends: 185 [2024-11-17 00:29:19,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=167, Invalid=1241, Unknown=2, NotChecked=72, Total=1482 [2024-11-17 00:29:19,115 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 14 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:19,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 998 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1329 Invalid, 0 Unknown, 149 Unchecked, 0.9s Time] [2024-11-17 00:29:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-17 00:29:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-17 00:29:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 147 states have (on average 1.5850340136054422) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2024-11-17 00:29:19,119 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 39 [2024-11-17 00:29:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:19,119 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2024-11-17 00:29:19,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2024-11-17 00:29:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:29:19,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:19,120 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:19,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:29:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:19,324 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023053, now seen corresponding path program 1 times [2024-11-17 00:29:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605184567] [2024-11-17 00:29:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:29:19,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:19,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605184567] [2024-11-17 00:29:19,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605184567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:19,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:19,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908412269] [2024-11-17 00:29:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:19,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:19,410 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:19,597 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2024-11-17 00:29:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-17 00:29:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:19,599 INFO L225 Difference]: With dead ends: 184 [2024-11-17 00:29:19,599 INFO L226 Difference]: Without dead ends: 184 [2024-11-17 00:29:19,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:19,599 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:19,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 329 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-17 00:29:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-17 00:29:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 183 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2024-11-17 00:29:19,603 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 42 [2024-11-17 00:29:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:19,603 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2024-11-17 00:29:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2024-11-17 00:29:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:29:19,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:19,604 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:29:19,605 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023052, now seen corresponding path program 1 times [2024-11-17 00:29:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486741896] [2024-11-17 00:29:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486741896] [2024-11-17 00:29:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486741896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174724523] [2024-11-17 00:29:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:19,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:19,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:29:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:20,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 00:29:20,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:20,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:20,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:20,191 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-17 00:29:20,308 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 23 treesize of output 15 [2024-11-17 00:29:20,313 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 26 treesize of output 14 [2024-11-17 00:29:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:20,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:20,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:20,404 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 31 treesize of output 35 [2024-11-17 00:29:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:20,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174724523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:20,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:20,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-11-17 00:29:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083544914] [2024-11-17 00:29:20,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:20,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 00:29:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 00:29:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2024-11-17 00:29:20,606 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:21,289 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2024-11-17 00:29:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:29:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 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-17 00:29:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:21,290 INFO L225 Difference]: With dead ends: 207 [2024-11-17 00:29:21,290 INFO L226 Difference]: Without dead ends: 207 [2024-11-17 00:29:21,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2024-11-17 00:29:21,292 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 285 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:21,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 891 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:29:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-17 00:29:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2024-11-17 00:29:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 147 states have (on average 1.564625850340136) internal successors, (230), 183 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2024-11-17 00:29:21,295 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 42 [2024-11-17 00:29:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2024-11-17 00:29:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2024-11-17 00:29:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:29:21,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:21,296 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:21,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-17 00:29:21,498 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1667943142, now seen corresponding path program 1 times [2024-11-17 00:29:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861352196] [2024-11-17 00:29:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861352196] [2024-11-17 00:29:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861352196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941873164] [2024-11-17 00:29:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:21,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:21,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:21,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:29:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:21,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:29:21,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:21,839 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-17 00:29:21,859 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:29:21,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-11-17 00:29:21,899 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-17 00:29:21,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-17 00:29:21,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-17 00:29:21,972 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-17 00:29:21,972 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 58 treesize of output 40 [2024-11-17 00:29:22,032 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-17 00:29:22,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2024-11-17 00:29:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:22,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941873164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:22,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-17 00:29:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355930488] [2024-11-17 00:29:22,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:22,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:29:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:29:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:29:22,190 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,282 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-17 00:29:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:26,586 INFO L93 Difference]: Finished difference Result 182 states and 227 transitions. [2024-11-17 00:29:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:29:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 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-17 00:29:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:26,588 INFO L225 Difference]: With dead ends: 182 [2024-11-17 00:29:26,588 INFO L226 Difference]: Without dead ends: 182 [2024-11-17 00:29:26,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:29:26,588 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:26,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 608 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-17 00:29:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-17 00:29:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-17 00:29:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5734265734265733) internal successors, (225), 179 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2024-11-17 00:29:26,596 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 43 [2024-11-17 00:29:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:26,596 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2024-11-17 00:29:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2024-11-17 00:29:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:29:26,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:26,596 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:26,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:26,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:26,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:26,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash 81650854, now seen corresponding path program 1 times [2024-11-17 00:29:26,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:26,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727201386] [2024-11-17 00:29:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727201386] [2024-11-17 00:29:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727201386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748991294] [2024-11-17 00:29:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:27,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:27,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:27,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:29:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:27,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:29:27,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:27,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:27,442 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-17 00:29:27,500 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 15 treesize of output 7 [2024-11-17 00:29:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:27,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:29:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748991294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:29:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-11-17 00:29:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104307616] [2024-11-17 00:29:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:29:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:29:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:29:27,523 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:27,641 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2024-11-17 00:29:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:29:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-17 00:29:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:27,643 INFO L225 Difference]: With dead ends: 202 [2024-11-17 00:29:27,643 INFO L226 Difference]: Without dead ends: 202 [2024-11-17 00:29:27,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:29:27,643 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 61 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:27,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 528 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-17 00:29:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2024-11-17 00:29:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5664335664335665) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2024-11-17 00:29:27,653 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 45 [2024-11-17 00:29:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:27,653 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2024-11-17 00:29:27,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2024-11-17 00:29:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:29:27,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:27,653 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:27,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:27,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:27,854 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1763790768, now seen corresponding path program 1 times [2024-11-17 00:29:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824448015] [2024-11-17 00:29:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824448015] [2024-11-17 00:29:28,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824448015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608865371] [2024-11-17 00:29:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:28,142 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:28,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:29:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:28,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:29:28,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:28,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:28,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:28,416 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-17 00:29:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:29:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:28,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608865371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:28,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-17 00:29:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713995622] [2024-11-17 00:29:28,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:28,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:29:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:29:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:29:28,605 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:29,069 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2024-11-17 00:29:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:29:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 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 46 [2024-11-17 00:29:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:29,071 INFO L225 Difference]: With dead ends: 199 [2024-11-17 00:29:29,071 INFO L226 Difference]: Without dead ends: 199 [2024-11-17 00:29:29,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 00:29:29,071 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 190 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:29,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 686 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-17 00:29:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2024-11-17 00:29:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 179 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 223 transitions. [2024-11-17 00:29:29,075 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 223 transitions. Word has length 46 [2024-11-17 00:29:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:29,075 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 223 transitions. [2024-11-17 00:29:29,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 223 transitions. [2024-11-17 00:29:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:29:29,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:29,076 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:29,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:29,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 00:29:29,277 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:29,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -465062722, now seen corresponding path program 1 times [2024-11-17 00:29:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272278858] [2024-11-17 00:29:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272278858] [2024-11-17 00:29:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272278858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360342227] [2024-11-17 00:29:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:30,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:30,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:29:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:30,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-17 00:29:30,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:30,313 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-17 00:29:30,330 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:29:30,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-11-17 00:29:30,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:30,454 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2024-11-17 00:29:30,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2024-11-17 00:29:30,499 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 26 treesize of output 19 [2024-11-17 00:29:30,529 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 26 treesize of output 19 [2024-11-17 00:29:30,576 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2024-11-17 00:29:30,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2024-11-17 00:29:30,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-17 00:29:30,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2024-11-17 00:29:30,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:30,808 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-17 00:29:30,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 87 [2024-11-17 00:29:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:31,430 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:29:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 45 [2024-11-17 00:29:31,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:29:31,731 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:29:31,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2024-11-17 00:29:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:31,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:32,310 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 8 treesize of output 4 [2024-11-17 00:29:33,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 129 [2024-11-17 00:29:33,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:29:33,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2024-11-17 00:29:33,751 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 19 treesize of output 15 [2024-11-17 00:29:33,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 192 [2024-11-17 00:29:33,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:29:33,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1396 treesize of output 1386 [2024-11-17 00:29:33,954 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 241 treesize of output 225 [2024-11-17 00:29:33,964 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 45 treesize of output 41 [2024-11-17 00:29:33,977 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 8 treesize of output 4 [2024-11-17 00:29:33,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,992 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 54 treesize of output 54 [2024-11-17 00:29:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360342227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:43,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 23] total 55 [2024-11-17 00:29:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181982783] [2024-11-17 00:29:43,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-17 00:29:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-17 00:29:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2714, Unknown=3, NotChecked=0, Total=3080 [2024-11-17 00:29:43,633 INFO L87 Difference]: Start difference. First operand 180 states and 223 transitions. Second operand has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 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-17 00:29:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:47,616 INFO L93 Difference]: Finished difference Result 223 states and 272 transitions. [2024-11-17 00:29:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:29:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 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) Word has length 51 [2024-11-17 00:29:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:47,617 INFO L225 Difference]: With dead ends: 223 [2024-11-17 00:29:47,618 INFO L226 Difference]: Without dead ends: 223 [2024-11-17 00:29:47,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=647, Invalid=3771, Unknown=4, NotChecked=0, Total=4422 [2024-11-17 00:29:47,619 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:47,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1431 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2472 Invalid, 2 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 00:29:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-17 00:29:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 177. [2024-11-17 00:29:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 140 states have (on average 1.55) internal successors, (217), 176 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2024-11-17 00:29:47,623 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 51 [2024-11-17 00:29:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:47,624 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2024-11-17 00:29:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 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-17 00:29:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2024-11-17 00:29:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:29:47,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:47,625 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:29:47,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 00:29:47,826 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:29:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -465062721, now seen corresponding path program 1 times [2024-11-17 00:29:47,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:47,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692421446] [2024-11-17 00:29:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:49,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692421446] [2024-11-17 00:29:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692421446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563444527] [2024-11-17 00:29:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:49,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:49,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:49,014 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:49,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 00:29:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:49,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-17 00:29:49,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:49,200 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-17 00:29:49,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:29:49,246 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:29:49,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-17 00:29:49,264 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:29:49,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:29:49,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:49,352 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-17 00:29:49,428 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:29:49,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-17 00:29:49,466 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-17 00:29:49,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:29:49,530 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 16 treesize of output 11 [2024-11-17 00:29:49,536 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 43 treesize of output 32 [2024-11-17 00:29:49,583 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 16 treesize of output 11 [2024-11-17 00:29:49,590 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 43 treesize of output 32 [2024-11-17 00:29:49,662 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:29:49,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-17 00:29:49,683 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-17 00:29:49,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-17 00:29:49,783 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 16 treesize of output 11 [2024-11-17 00:29:49,793 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 34 treesize of output 25 [2024-11-17 00:29:49,826 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 37 treesize of output 28 [2024-11-17 00:29:49,838 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-17 00:29:49,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:29:49,906 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 82 treesize of output 69 [2024-11-17 00:29:49,911 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 27 treesize of output 22 [2024-11-17 00:29:50,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 00:29:50,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:50,148 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 54 treesize of output 26 [2024-11-17 00:29:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:50,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:50,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1652 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1649))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse0) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse1 |c_ULTIMATE.start_main_~data~0#1.base| .cse0) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1648) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_1652 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1649))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse4) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse5 |c_ULTIMATE.start_main_~data~0#1.base| .cse4) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 4))))) is different from false [2024-11-17 00:29:55,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 67 [2024-11-17 00:29:55,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 270 [2024-11-17 00:29:55,472 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 33 treesize of output 29 [2024-11-17 00:29:55,481 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 50 treesize of output 42 [2024-11-17 00:29:55,506 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 8 treesize of output 4 [2024-11-17 00:29:55,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,524 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 31 treesize of output 31 [2024-11-17 00:29:55,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 141 [2024-11-17 00:29:55,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 101 [2024-11-17 00:29:55,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 706 treesize of output 699 [2024-11-17 00:29:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1188 treesize of output 1182 [2024-11-17 00:29:55,788 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 53 treesize of output 49 [2024-11-17 00:29:55,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-17 00:29:55,810 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 68 treesize of output 60 [2024-11-17 00:29:55,820 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 90 treesize of output 82 [2024-11-17 00:29:55,851 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 8 treesize of output 4 [2024-11-17 00:29:55,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:55,887 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 39 treesize of output 39 [2024-11-17 00:30:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563444527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:01,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2024-11-17 00:30:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621360206] [2024-11-17 00:30:01,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:01,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-17 00:30:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-17 00:30:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1370, Unknown=17, NotChecked=76, Total=1640 [2024-11-17 00:30:01,914 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:06,049 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-17 00:30:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:12,316 INFO L93 Difference]: Finished difference Result 293 states and 349 transitions. [2024-11-17 00:30:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:30:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-17 00:30:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:12,317 INFO L225 Difference]: With dead ends: 293 [2024-11-17 00:30:12,317 INFO L226 Difference]: Without dead ends: 293 [2024-11-17 00:30:12,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=507, Invalid=2786, Unknown=17, NotChecked=112, Total=3422 [2024-11-17 00:30:12,319 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 499 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:12,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 977 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1973 Invalid, 1 Unknown, 256 Unchecked, 6.4s Time] [2024-11-17 00:30:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-17 00:30:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 189. [2024-11-17 00:30:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 188 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 238 transitions. [2024-11-17 00:30:12,323 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 238 transitions. Word has length 51 [2024-11-17 00:30:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:12,323 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 238 transitions. [2024-11-17 00:30:12,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 238 transitions. [2024-11-17 00:30:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:30:12,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:12,324 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-17 00:30:12,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:30:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-17 00:30:12,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:30:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1532044220, now seen corresponding path program 1 times [2024-11-17 00:30:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993735790] [2024-11-17 00:30:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms