./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-data.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c43b1e86d53f0a623ddcdf970bae6b5fd24ed69ec4a9688050aa705dc6cf897 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:07:27,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:07:27,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 18:07:27,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:07:27,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:07:27,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:07:27,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:07:27,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:07:27,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:07:27,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:07:27,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:07:27,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:07:27,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:07:27,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:07:27,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:07:27,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:07:27,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:07:27,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:07:27,437 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:07:27,437 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:07:27,437 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:07:27,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:07:27,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:07:27,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:07:27,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:07:27,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:07:27,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:07:27,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:07:27,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:07:27,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:07:27,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:27,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:07:27,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:07:27,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:07:27,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:07:27,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:07:27,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:07:27,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:07:27,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:07:27,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c43b1e86d53f0a623ddcdf970bae6b5fd24ed69ec4a9688050aa705dc6cf897 [2024-10-11 18:07:27,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:07:27,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:07:27,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:07:27,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:07:27,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:07:27,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-data.i [2024-10-11 18:07:29,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:07:29,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:07:29,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-data.i [2024-10-11 18:07:29,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5abf3faf2/5170ae7a4995423397e5ac53b44338ad/FLAG48ab5ec0c [2024-10-11 18:07:29,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5abf3faf2/5170ae7a4995423397e5ac53b44338ad [2024-10-11 18:07:29,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:07:29,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:07:29,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:29,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:07:29,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:07:29,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:29,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2cb56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29, skipping insertion in model container [2024-10-11 18:07:29,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:29,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:07:29,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:29,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:07:29,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:29,998 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:07:29,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29 WrapperNode [2024-10-11 18:07:29,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:30,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:30,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:07:30,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:07:30,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,049 INFO L138 Inliner]: procedures = 121, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2024-10-11 18:07:30,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:30,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:07:30,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:07:30,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:07:30,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,101 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-10-11 18:07:30,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:07:30,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:07:30,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:07:30,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:07:30,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (1/1) ... [2024-10-11 18:07:30,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:30,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:30,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:07:30,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:07:30,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:07:30,214 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:07:30,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:07:30,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:07:30,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:07:30,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:07:30,613 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-10-11 18:07:30,613 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:07:30,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:07:30,688 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:07:30,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:30 BoogieIcfgContainer [2024-10-11 18:07:30,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:07:30,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:07:30,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:07:30,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:07:30,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:07:29" (1/3) ... [2024-10-11 18:07:30,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11896238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:30, skipping insertion in model container [2024-10-11 18:07:30,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:29" (2/3) ... [2024-10-11 18:07:30,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11896238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:30, skipping insertion in model container [2024-10-11 18:07:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:30" (3/3) ... [2024-10-11 18:07:30,709 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-fst-data.i [2024-10-11 18:07:30,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:07:30,742 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-11 18:07:30,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:07:30,850 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;@a61387b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:07:30,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 18:07:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:30,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:30,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:30,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 4452315, now seen corresponding path program 1 times [2024-10-11 18:07:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810519840] [2024-10-11 18:07:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810519840] [2024-10-11 18:07:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810519840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216092704] [2024-10-11 18:07:31,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:31,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:31,099 INFO L87 Difference]: Start difference. First operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:31,178 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-10-11 18:07:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:31,185 INFO L225 Difference]: With dead ends: 55 [2024-10-11 18:07:31,186 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:07:31,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:31,192 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:31,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:07:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 18:07:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-11 18:07:31,221 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2024-10-11 18:07:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:31,222 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-11 18:07:31,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-11 18:07:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:31,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:31,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:31,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:07:31,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 4452316, now seen corresponding path program 1 times [2024-10-11 18:07:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:31,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334658956] [2024-10-11 18:07:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334658956] [2024-10-11 18:07:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334658956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853528457] [2024-10-11 18:07:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:31,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:31,306 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:31,364 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-11 18:07:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:31,366 INFO L225 Difference]: With dead ends: 51 [2024-10-11 18:07:31,367 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 18:07:31,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:31,368 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:31,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 18:07:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 18:07:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-11 18:07:31,377 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2024-10-11 18:07:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:31,377 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-11 18:07:31,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-11 18:07:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:31,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:31,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:07:31,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -62470296, now seen corresponding path program 1 times [2024-10-11 18:07:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781278446] [2024-10-11 18:07:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781278446] [2024-10-11 18:07:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781278446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:07:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879811270] [2024-10-11 18:07:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:31,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:31,627 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:31,781 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-11 18:07:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:31,783 INFO L225 Difference]: With dead ends: 51 [2024-10-11 18:07:31,783 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 18:07:31,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:31,785 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:31,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 18:07:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-11 18:07:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-11 18:07:31,790 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2024-10-11 18:07:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:31,790 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-11 18:07:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-11 18:07:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:31,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:31,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:07:31,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -62470295, now seen corresponding path program 1 times [2024-10-11 18:07:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:31,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049495406] [2024-10-11 18:07:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049495406] [2024-10-11 18:07:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049495406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:07:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722743456] [2024-10-11 18:07:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:31,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:31,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:31,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:31,994 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:32,091 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-10-11 18:07:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:32,092 INFO L225 Difference]: With dead ends: 50 [2024-10-11 18:07:32,092 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 18:07:32,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:32,093 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:32,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 18:07:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-11 18:07:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-10-11 18:07:32,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 9 [2024-10-11 18:07:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:32,098 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-10-11 18:07:32,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-10-11 18:07:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:32,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:32,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:07:32,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1175375798, now seen corresponding path program 1 times [2024-10-11 18:07:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004170785] [2024-10-11 18:07:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004170785] [2024-10-11 18:07:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004170785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654186031] [2024-10-11 18:07:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,220 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:32,332 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-11 18:07:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:32,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:32,334 INFO L225 Difference]: With dead ends: 52 [2024-10-11 18:07:32,334 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 18:07:32,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,360 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 18:07:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-11 18:07:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-10-11 18:07:32,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 14 [2024-10-11 18:07:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:32,365 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-10-11 18:07:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-10-11 18:07:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:32,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:32,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:07:32,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:32,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1175375797, now seen corresponding path program 1 times [2024-10-11 18:07:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816707257] [2024-10-11 18:07:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:32,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816707257] [2024-10-11 18:07:32,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816707257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:32,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915387995] [2024-10-11 18:07:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:32,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:32,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,592 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:32,708 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-11 18:07:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:32,709 INFO L225 Difference]: With dead ends: 52 [2024-10-11 18:07:32,709 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 18:07:32,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,710 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:32,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 18:07:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-11 18:07:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-11 18:07:32,714 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2024-10-11 18:07:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:32,714 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-11 18:07:32,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-11 18:07:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:32,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:32,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:07:32,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 38567467, now seen corresponding path program 1 times [2024-10-11 18:07:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283320968] [2024-10-11 18:07:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283320968] [2024-10-11 18:07:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283320968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:32,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:32,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315474129] [2024-10-11 18:07:32,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:32,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,825 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:32,903 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-11 18:07:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 18:07:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:32,904 INFO L225 Difference]: With dead ends: 53 [2024-10-11 18:07:32,905 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 18:07:32,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:32,906 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:32,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 193 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 18:07:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-11 18:07:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-11 18:07:32,909 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2024-10-11 18:07:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:32,909 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-11 18:07:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-11 18:07:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:32,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,910 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:32,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:07:32,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:32,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 40303171, now seen corresponding path program 1 times [2024-10-11 18:07:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064770003] [2024-10-11 18:07:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064770003] [2024-10-11 18:07:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064770003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718386605] [2024-10-11 18:07:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:33,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:33,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:07:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 18:07:33,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:33,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:33,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:33,588 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-10-11 18:07:33,621 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-10-11 18:07:33,634 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-10-11 18:07:33,764 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 18:07:33,764 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 27 treesize of output 17 [2024-10-11 18:07:33,782 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 18:07:33,783 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 27 treesize of output 17 [2024-10-11 18:07:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:33,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:34,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:07:34,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 18:07:34,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:07:34,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:34,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718386605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:34,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:34,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2024-10-11 18:07:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97157452] [2024-10-11 18:07:34,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:34,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:07:34,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:07:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:07:34,465 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 23 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:34,755 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-11 18:07:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2024-10-11 18:07:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:34,756 INFO L225 Difference]: With dead ends: 54 [2024-10-11 18:07:34,756 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:07:34,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:07:34,757 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:34,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 431 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:07:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-10-11 18:07:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.606060606060606) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-11 18:07:34,761 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2024-10-11 18:07:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:34,761 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-11 18:07:34,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-11 18:07:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:34,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:34,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:34,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:07:34,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:34,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:34,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 646537751, now seen corresponding path program 1 times [2024-10-11 18:07:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:34,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813995754] [2024-10-11 18:07:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:35,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813995754] [2024-10-11 18:07:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813995754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26873647] [2024-10-11 18:07:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:35,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:35,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:35,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:07:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:07:35,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:35,270 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-11 18:07:35,294 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:07:35,295 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 19 treesize of output 16 [2024-10-11 18:07:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:35,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26873647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:35,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:07:35,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 18:07:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666809349] [2024-10-11 18:07:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:35,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:07:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:07:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:07:35,299 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:35,339 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-10-11 18:07:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:07:35,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-11 18:07:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:35,340 INFO L225 Difference]: With dead ends: 55 [2024-10-11 18:07:35,340 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 18:07:35,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:07:35,341 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:35,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2024-10-11 18:07:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 18:07:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 18:07:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-10-11 18:07:35,344 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 18 [2024-10-11 18:07:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:35,345 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-10-11 18:07:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-10-11 18:07:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:35,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:35,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:35,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:07:35,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:35,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 646537752, now seen corresponding path program 1 times [2024-10-11 18:07:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758578622] [2024-10-11 18:07:35,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758578622] [2024-10-11 18:07:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758578622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374357416] [2024-10-11 18:07:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:35,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:35,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:07:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:07:35,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:36,073 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:07:36,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:36,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:36,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 18:07:36,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374357416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:36,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:36,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-10-11 18:07:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636391172] [2024-10-11 18:07:36,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:07:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:07:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:07:36,213 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 19 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,424 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-11 18:07:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:36,424 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-10-11 18:07:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,425 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:07:36,425 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:07:36,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=389, Unknown=1, NotChecked=40, Total=506 [2024-10-11 18:07:36,426 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 212 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2024-10-11 18:07:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:07:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-11 18:07:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 55 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-11 18:07:36,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 18 [2024-10-11 18:07:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,430 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-11 18:07:36,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-11 18:07:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:36,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:07:36,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:36,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:36,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 74952164, now seen corresponding path program 1 times [2024-10-11 18:07:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123263038] [2024-10-11 18:07:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123263038] [2024-10-11 18:07:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123263038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395132305] [2024-10-11 18:07:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:36,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:36,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:07:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:07:36,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:36,811 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:36,812 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 12 treesize of output 11 [2024-10-11 18:07:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395132305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:36,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-11 18:07:36,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002620704] [2024-10-11 18:07:36,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:36,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:36,821 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,901 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-11 18:07:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:07:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:07:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,902 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:07:36,903 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:07:36,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:36,903 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 95 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:07:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-11 18:07:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 56 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2024-10-11 18:07:36,907 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 18 [2024-10-11 18:07:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-10-11 18:07:36,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2024-10-11 18:07:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:36,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:07:37,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 74952165, now seen corresponding path program 1 times [2024-10-11 18:07:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416274904] [2024-10-11 18:07:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416274904] [2024-10-11 18:07:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416274904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481066115] [2024-10-11 18:07:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:37,275 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:37,403 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-11 18:07:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:37,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:07:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:37,404 INFO L225 Difference]: With dead ends: 65 [2024-10-11 18:07:37,404 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 18:07:37,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:37,404 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:37,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 18:07:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 18:07:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 60 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-10-11 18:07:37,408 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2024-10-11 18:07:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-11 18:07:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2024-10-11 18:07:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:37,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:37,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:37,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:07:37,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1971451658, now seen corresponding path program 1 times [2024-10-11 18:07:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616392314] [2024-10-11 18:07:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616392314] [2024-10-11 18:07:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616392314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:07:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828462486] [2024-10-11 18:07:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:37,522 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:37,614 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-10-11 18:07:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 18:07:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:37,615 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:37,615 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:07:37,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:37,616 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:37,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 184 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:07:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-11 18:07:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 60 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-10-11 18:07:37,619 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 19 [2024-10-11 18:07:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:37,619 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-10-11 18:07:37,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-10-11 18:07:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:37,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:37,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:37,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:07:37,620 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:37,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1447396368, now seen corresponding path program 1 times [2024-10-11 18:07:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469257637] [2024-10-11 18:07:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:07:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469257637] [2024-10-11 18:07:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469257637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047349416] [2024-10-11 18:07:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:37,741 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:37,834 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-10-11 18:07:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-11 18:07:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:37,835 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:07:37,835 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:07:37,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:37,836 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:37,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:07:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 18:07:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.488888888888889) internal successors, (67), 59 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-11 18:07:37,839 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 20 [2024-10-11 18:07:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:37,839 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-11 18:07:37,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-11 18:07:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:37,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:37,840 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:07:37,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:37,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1447396367, now seen corresponding path program 1 times [2024-10-11 18:07:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344831056] [2024-10-11 18:07:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:38,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344831056] [2024-10-11 18:07:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344831056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:38,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:38,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282336258] [2024-10-11 18:07:38,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:38,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:38,054 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,152 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-10-11 18:07:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-11 18:07:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,153 INFO L225 Difference]: With dead ends: 63 [2024-10-11 18:07:38,153 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 18:07:38,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:38,153 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 143 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 18:07:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 18:07:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-10-11 18:07:38,156 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 20 [2024-10-11 18:07:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,157 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-10-11 18:07:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-10-11 18:07:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:38,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:07:38,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:38,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -985382589, now seen corresponding path program 1 times [2024-10-11 18:07:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037457945] [2024-10-11 18:07:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037457945] [2024-10-11 18:07:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037457945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010571948] [2024-10-11 18:07:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:38,281 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,385 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-11 18:07:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:38,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:07:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,386 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:07:38,386 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:07:38,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:38,386 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 156 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:07:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-11 18:07:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.446808510638298) internal successors, (68), 60 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-11 18:07:38,389 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2024-10-11 18:07:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,389 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-11 18:07:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-11 18:07:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:38,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:07:38,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:38,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,390 INFO L85 PathProgramCache]: Analyzing trace with hash 621573974, now seen corresponding path program 1 times [2024-10-11 18:07:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139138772] [2024-10-11 18:07:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:38,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139138772] [2024-10-11 18:07:38,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139138772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:38,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029763055] [2024-10-11 18:07:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:38,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:38,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:07:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:07:38,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:38,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:38,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:38,877 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-10-11 18:07:38,920 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:38,920 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 34 treesize of output 33 [2024-10-11 18:07:38,928 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-10-11 18:07:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:38,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029763055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:07:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-10-11 18:07:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746862816] [2024-10-11 18:07:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:07:38,932 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,094 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-11 18:07:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 18:07:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,095 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:07:39,095 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:07:39,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:07:39,095 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 200 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:07:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-11 18:07:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.425531914893617) internal successors, (67), 60 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-10-11 18:07:39,100 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2024-10-11 18:07:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,101 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-10-11 18:07:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-10-11 18:07:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:39,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,101 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:07:39,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash 621573975, now seen corresponding path program 1 times [2024-10-11 18:07:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062705041] [2024-10-11 18:07:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062705041] [2024-10-11 18:07:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062705041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588359570] [2024-10-11 18:07:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:39,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:39,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:07:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:07:40,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:40,164 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-10-11 18:07:40,271 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:40,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:40,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:40,326 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-10-11 18:07:40,431 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:40,431 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 50 treesize of output 45 [2024-10-11 18:07:40,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 24 treesize of output 11 [2024-10-11 18:07:40,453 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-10-11 18:07:40,457 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-10-11 18:07:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:40,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588359570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:07:40,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-10-11 18:07:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275770256] [2024-10-11 18:07:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:40,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:07:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:07:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:07:40,503 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:40,863 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-11 18:07:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 18:07:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:40,864 INFO L225 Difference]: With dead ends: 65 [2024-10-11 18:07:40,864 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 18:07:40,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:07:40,865 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:40,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 18:07:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 18:07:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-10-11 18:07:40,871 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 22 [2024-10-11 18:07:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-10-11 18:07:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-10-11 18:07:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:07:40,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:40,872 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:40,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:07:41,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 568886048, now seen corresponding path program 1 times [2024-10-11 18:07:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986840874] [2024-10-11 18:07:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:41,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986840874] [2024-10-11 18:07:41,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986840874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679049792] [2024-10-11 18:07:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:41,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:41,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:07:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:07:41,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:41,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:41,736 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 15 treesize of output 15 [2024-10-11 18:07:41,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:41,742 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 15 treesize of output 15 [2024-10-11 18:07:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:41,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:41,858 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 18:07:41,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 18:07:41,868 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 18:07:41,868 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 20 treesize of output 12 [2024-10-11 18:07:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679049792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:41,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 21 [2024-10-11 18:07:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517666584] [2024-10-11 18:07:41,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:41,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:07:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:07:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:07:41,970 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:42,332 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-10-11 18:07:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:07:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 18:07:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:42,333 INFO L225 Difference]: With dead ends: 76 [2024-10-11 18:07:42,333 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 18:07:42,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2024-10-11 18:07:42,334 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:42,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 307 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 18:07:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-11 18:07:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-10-11 18:07:42,336 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 23 [2024-10-11 18:07:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-11 18:07:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-10-11 18:07:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:07:42,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:42,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:42,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:07:42,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:42,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:42,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 455596858, now seen corresponding path program 1 times [2024-10-11 18:07:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415540044] [2024-10-11 18:07:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415540044] [2024-10-11 18:07:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415540044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689779480] [2024-10-11 18:07:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:42,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:42,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:42,688 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:42,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:07:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:07:42,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:42,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 13 treesize of output 9 [2024-10-11 18:07:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:42,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:42,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_25| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_25| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_25|) 0)))) is different from false [2024-10-11 18:07:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689779480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:42,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2024-10-11 18:07:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755712504] [2024-10-11 18:07:42,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:42,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:07:42,902 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:43,045 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-10-11 18:07:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 18:07:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:43,046 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:07:43,046 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:07:43,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:07:43,047 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 164 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:07:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 18:07:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 61 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-11 18:07:43,050 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 24 [2024-10-11 18:07:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:43,050 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-11 18:07:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-11 18:07:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:07:43,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:43,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:43,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:43,255 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash 91452393, now seen corresponding path program 1 times [2024-10-11 18:07:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382136985] [2024-10-11 18:07:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:07:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382136985] [2024-10-11 18:07:43,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382136985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038288458] [2024-10-11 18:07:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:43,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:43,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:43,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:07:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:07:43,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:07:43,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:43,530 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:43,531 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 12 treesize of output 11 [2024-10-11 18:07:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:07:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038288458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:43,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-10-11 18:07:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452182841] [2024-10-11 18:07:43,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:43,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:43,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:43,544 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:43,614 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-10-11 18:07:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 18:07:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:43,615 INFO L225 Difference]: With dead ends: 72 [2024-10-11 18:07:43,615 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 18:07:43,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:43,616 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:43,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 110 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 18:07:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-11 18:07:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.471698113207547) internal successors, (78), 66 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2024-10-11 18:07:43,619 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 28 [2024-10-11 18:07:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:43,620 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2024-10-11 18:07:43,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2024-10-11 18:07:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:07:43,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:43,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:43,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:07:43,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:43,825 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:43,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash 91452394, now seen corresponding path program 1 times [2024-10-11 18:07:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932812097] [2024-10-11 18:07:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932812097] [2024-10-11 18:07:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932812097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799640814] [2024-10-11 18:07:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:44,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:44,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:07:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:07:44,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:44,151 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-10-11 18:07:44,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:44,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:44,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:44,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-10-11 18:07:44,380 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-10-11 18:07:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:44,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:44,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799640814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:44,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:44,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2024-10-11 18:07:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166244020] [2024-10-11 18:07:44,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:44,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:07:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:07:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:07:44,581 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:44,915 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2024-10-11 18:07:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-10-11 18:07:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:44,916 INFO L225 Difference]: With dead ends: 71 [2024-10-11 18:07:44,916 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 18:07:44,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 18:07:44,917 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:44,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 313 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 18:07:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 18:07:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 66 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-10-11 18:07:44,919 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 28 [2024-10-11 18:07:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:44,919 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-10-11 18:07:44,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2024-10-11 18:07:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:07:44,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:44,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:44,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:07:45,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:07:45,120 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1986449954, now seen corresponding path program 1 times [2024-10-11 18:07:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:45,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585674713] [2024-10-11 18:07:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585674713] [2024-10-11 18:07:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585674713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073899027] [2024-10-11 18:07:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:45,570 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:45,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:07:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-11 18:07:45,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:45,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:45,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:45,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:07:45,948 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-10-11 18:07:45,987 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-10-11 18:07:46,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:46,028 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 49 treesize of output 35 [2024-10-11 18:07:46,103 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:46,104 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 34 treesize of output 33 [2024-10-11 18:07:46,182 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-10-11 18:07:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:46,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:46,325 INFO L349 Elim1Store]: treesize reduction 5, result has 87.2 percent of original size [2024-10-11 18:07:46,326 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 43 treesize of output 42 [2024-10-11 18:07:46,455 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-10-11 18:07:46,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 94 [2024-10-11 18:07:46,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:46,480 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 396 treesize of output 391 [2024-10-11 18:07:46,512 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 180 treesize of output 170 [2024-10-11 18:07:46,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:46,546 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 175 treesize of output 161 [2024-10-11 18:07:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073899027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:46,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:46,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-10-11 18:07:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832609842] [2024-10-11 18:07:46,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:46,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:07:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:07:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1500, Unknown=9, NotChecked=0, Total=1640 [2024-10-11 18:07:46,955 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 33 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:47,442 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-10-11 18:07:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:07:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-10-11 18:07:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:47,443 INFO L225 Difference]: With dead ends: 74 [2024-10-11 18:07:47,443 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 18:07:47,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=216, Invalid=2127, Unknown=9, NotChecked=0, Total=2352 [2024-10-11 18:07:47,444 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:47,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 403 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:07:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 18:07:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-11 18:07:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 68 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2024-10-11 18:07:47,451 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2024-10-11 18:07:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:47,452 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2024-10-11 18:07:47,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2024-10-11 18:07:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:07:47,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:47,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:47,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:07:47,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:07:47,654 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1986449955, now seen corresponding path program 1 times [2024-10-11 18:07:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:47,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179497818] [2024-10-11 18:07:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179497818] [2024-10-11 18:07:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179497818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602372191] [2024-10-11 18:07:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:48,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:07:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-11 18:07:48,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:48,612 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-10-11 18:07:48,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:48,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:48,720 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-10-11 18:07:48,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:48,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:48,825 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 50 treesize of output 45 [2024-10-11 18:07:48,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:07:48,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:48,887 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 50 treesize of output 45 [2024-10-11 18:07:48,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:07:48,980 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-10-11 18:07:48,983 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-10-11 18:07:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:49,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:49,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:49,357 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 73 treesize of output 74 [2024-10-11 18:07:49,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:49,362 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 65 treesize of output 50 [2024-10-11 18:07:49,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:49,372 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 632 treesize of output 567 [2024-10-11 18:07:49,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:49,398 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 1127 treesize of output 1070 [2024-10-11 18:07:49,423 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 547 treesize of output 523 [2024-10-11 18:07:49,432 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 523 treesize of output 499 [2024-10-11 18:07:49,440 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 499 treesize of output 491 [2024-10-11 18:07:49,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:49,453 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 491 treesize of output 447 [2024-10-11 18:07:50,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:50,482 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 36 treesize of output 37 [2024-10-11 18:07:50,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-11 18:07:50,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:50,501 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 28 treesize of output 20 [2024-10-11 18:07:50,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:50,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 18:07:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602372191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:50,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2024-10-11 18:07:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753098217] [2024-10-11 18:07:50,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:50,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:07:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:07:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1496, Unknown=11, NotChecked=0, Total=1640 [2024-10-11 18:07:50,713 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:51,270 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-10-11 18:07:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:07:51,270 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-10-11 18:07:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:51,271 INFO L225 Difference]: With dead ends: 74 [2024-10-11 18:07:51,271 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 18:07:51,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=2221, Unknown=11, NotChecked=0, Total=2450 [2024-10-11 18:07:51,272 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:51,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 466 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:07:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 18:07:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-11 18:07:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 68 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-10-11 18:07:51,274 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 30 [2024-10-11 18:07:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:51,274 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-10-11 18:07:51,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-10-11 18:07:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:07:51,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:51,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:51,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:07:51,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:07:51,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:51,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1712144842, now seen corresponding path program 1 times [2024-10-11 18:07:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477593143] [2024-10-11 18:07:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:07:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:07:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477593143] [2024-10-11 18:07:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477593143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334422644] [2024-10-11 18:07:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:52,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:52,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:52,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:52,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:07:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:07:52,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:52,339 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:52,354 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-10-11 18:07:52,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:52,390 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 25 treesize of output 26 [2024-10-11 18:07:52,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:52,417 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 34 treesize of output 33 [2024-10-11 18:07:52,422 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-10-11 18:07:52,430 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-11 18:07:52,450 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:07:52,450 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 19 treesize of output 16 [2024-10-11 18:07:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-11 18:07:52,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334422644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:52,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2024-10-11 18:07:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685573949] [2024-10-11 18:07:52,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:52,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:07:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:07:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=489, Unknown=1, NotChecked=44, Total=600 [2024-10-11 18:07:52,492 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 24 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:07:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:52,711 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-11 18:07:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:52,712 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 32 [2024-10-11 18:07:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:52,712 INFO L225 Difference]: With dead ends: 71 [2024-10-11 18:07:52,712 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 18:07:52,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=761, Unknown=1, NotChecked=56, Total=930 [2024-10-11 18:07:52,713 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:52,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 208 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2024-10-11 18:07:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 18:07:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 18:07:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.4) internal successors, (77), 66 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-10-11 18:07:52,716 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 32 [2024-10-11 18:07:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:52,716 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-10-11 18:07:52,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:07:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-10-11 18:07:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:07:52,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:52,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:52,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:07:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:52,917 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:52,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1712144841, now seen corresponding path program 1 times [2024-10-11 18:07:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248733175] [2024-10-11 18:07:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:07:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:07:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248733175] [2024-10-11 18:07:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248733175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765265781] [2024-10-11 18:07:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:53,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:53,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:07:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:07:53,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:53,785 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-10-11 18:07:53,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:53,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:53,846 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-10-11 18:07:53,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:53,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:53,887 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 50 treesize of output 45 [2024-10-11 18:07:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:07:53,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:07:53,933 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 59 treesize of output 52 [2024-10-11 18:07:53,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:07:53,969 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 34 treesize of output 18 [2024-10-11 18:07:53,975 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-10-11 18:07:54,032 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:07:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:54,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:54,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:54,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 18:07:54,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:54,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765265781] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:54,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:54,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2024-10-11 18:07:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886119417] [2024-10-11 18:07:54,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:54,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:07:54,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:54,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:07:54,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2024-10-11 18:07:54,148 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 27 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:07:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:54,580 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-10-11 18:07:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:07:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2024-10-11 18:07:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:54,581 INFO L225 Difference]: With dead ends: 67 [2024-10-11 18:07:54,581 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 18:07:54,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1292, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 18:07:54,582 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:54,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 254 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 391 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2024-10-11 18:07:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 18:07:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 18:07:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2024-10-11 18:07:54,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 32 [2024-10-11 18:07:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:54,584 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2024-10-11 18:07:54,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:07:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-10-11 18:07:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:07:54,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:54,585 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:07:54,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:07:54,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:07:54,785 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:54,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2011236868, now seen corresponding path program 1 times [2024-10-11 18:07:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584570031] [2024-10-11 18:07:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:07:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584570031] [2024-10-11 18:07:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584570031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020031292] [2024-10-11 18:07:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:54,958 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:54,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:07:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 18:07:55,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:55,435 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-11 18:07:55,436 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 3 case distinctions, treesize of input 24 treesize of output 24 [2024-10-11 18:07:55,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:07:55,494 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 15 treesize of output 1 [2024-10-11 18:07:55,526 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 24 treesize of output 12 [2024-10-11 18:07:55,575 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-10-11 18:07:55,607 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-10-11 18:07:55,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:55,641 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-10-11 18:07:55,651 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-10-11 18:07:55,652 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 20 treesize of output 22 [2024-10-11 18:07:55,718 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 16 treesize of output 8 [2024-10-11 18:07:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:55,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:55,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:55,880 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 53 treesize of output 48 [2024-10-11 18:07:56,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:56,191 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 82 treesize of output 83 [2024-10-11 18:07:56,199 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 95 treesize of output 87 [2024-10-11 18:07:56,205 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 83 treesize of output 81 [2024-10-11 18:07:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020031292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:56,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:56,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 27 [2024-10-11 18:07:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072053283] [2024-10-11 18:07:56,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:56,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:07:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:07:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1137, Unknown=4, NotChecked=0, Total=1260 [2024-10-11 18:07:56,622 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 27 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:07:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:57,142 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-11 18:07:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 18:07:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2024-10-11 18:07:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:57,143 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:57,143 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:07:57,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=2123, Unknown=4, NotChecked=0, Total=2352 [2024-10-11 18:07:57,144 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:57,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 229 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:07:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-10-11 18:07:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-11 18:07:57,147 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 32 [2024-10-11 18:07:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,147 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-11 18:07:57,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:07:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-11 18:07:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:07:57,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,147 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:57,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:07:57,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:07:57,349 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:07:57,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2012972571, now seen corresponding path program 2 times [2024-10-11 18:07:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001294480] [2024-10-11 18:07:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001294480] [2024-10-11 18:07:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001294480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17005349] [2024-10-11 18:07:58,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:07:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:58,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:58,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:07:58,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:07:58,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:07:58,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-11 18:07:58,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:58,970 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-10-11 18:07:59,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:59,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:59,056 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-10-11 18:07:59,060 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-10-11 18:07:59,068 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-10-11 18:07:59,083 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-10-11 18:07:59,100 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:59,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:59,113 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 22 [2024-10-11 18:07:59,123 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 15 [2024-10-11 18:07:59,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,224 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-10-11 18:07:59,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 54 [2024-10-11 18:07:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,237 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-10-11 18:07:59,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,432 INFO L349 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2024-10-11 18:07:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 93 [2024-10-11 18:07:59,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:59,471 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-10-11 18:07:59,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 47 [2024-10-11 18:07:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:59,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:59,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse1 (+ 16 |c_ULTIMATE.start_create_#t~mem9#1.offset|))) (and (forall ((v_ArrVal_2999 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2999 .cse1)) v_ArrVal_2999)) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (or (= (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse3 .cse1 v_ArrVal_3000)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2999) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0))))) (forall ((v_ArrVal_2999 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2999 .cse1)) v_ArrVal_2999)) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2999))) (or (= 0 (select (select .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse3 .cse1 v_ArrVal_3000)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|)) |v_ULTIMATE.start_loop_~node~0#1.offset_44|)) (< (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))))))) is different from false [2024-10-11 18:08:00,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse0 (select |c_#memory_$Pointer$#0.offset| .cse3))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse1 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (not (= v_ArrVal_2999 (store .cse0 .cse1 (select v_ArrVal_2999 .cse1)))) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (or (= 0 (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse1 v_ArrVal_3000)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_44|)) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_2999) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse5))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse5) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse7 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_2999))) (or (= (select (select .cse6 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse7 v_ArrVal_3000)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|)) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))) (not (= v_ArrVal_2999 (store .cse0 .cse7 (select v_ArrVal_2999 .cse7)))))))))))) is different from false [2024-10-11 18:08:00,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_create_#t~mem8#1.offset| 8))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base|) .cse10 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base|) .cse10 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse4 (select .cse2 .cse3)) (.cse7 (select .cse6 .cse3))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse0) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse5 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (or (= (select (let ((.cse1 (store .cse2 .cse3 (store .cse4 .cse5 v_ArrVal_3000)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select (store .cse6 .cse3 v_ArrVal_2999) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0))) (not (= (store .cse7 .cse5 (select v_ArrVal_2999 .cse5)) v_ArrVal_2999))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse0) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse9 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (let ((.cse8 (store .cse6 .cse3 v_ArrVal_2999))) (or (= (select (select .cse8 (select (select (store .cse2 .cse3 (store .cse4 .cse9 v_ArrVal_3000)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|)) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))) (not (= (store .cse7 .cse9 (select v_ArrVal_2999 .cse9)) v_ArrVal_2999)))))))))))) is different from false [2024-10-11 18:08:00,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#0.base| .cse6)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse6))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_32| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_32| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (let ((.cse8 (+ 8 |v_ULTIMATE.start_create_#t~mem8#1.offset_32|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse6 (store .cse9 .cse8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse6 (store .cse7 .cse8 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse3 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2999 .cse3)) v_ArrVal_2999)) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (or (< (select (select (store .cse1 .cse2 v_ArrVal_2999) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (= 0 (select (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_3000)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_44|)) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_32| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_32| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (let ((.cse15 (+ 8 |v_ULTIMATE.start_create_#t~mem8#1.offset_32|))) (let ((.cse10 (store |c_#memory_$Pointer$#0.offset| .cse6 (store .cse9 .cse15 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| .cse6 (store .cse7 .cse15 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse12 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|)) (.cse11 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (not (= (store (select .cse10 .cse11) .cse12 (select v_ArrVal_2999 .cse12)) v_ArrVal_2999)) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (let ((.cse13 (store .cse10 .cse11 v_ArrVal_2999))) (or (= (select (select .cse13 (select (select (store .cse14 .cse11 (store (select .cse14 .cse11) .cse12 v_ArrVal_3000)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|)) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))))))))))) is different from false [2024-10-11 18:08:00,288 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_#t~ret7#1.offset|))) (.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_#t~ret7#1.base|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse9 (select .cse8 |c_ULTIMATE.start_create_#t~ret7#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_32| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_32| |c_ULTIMATE.start_create_#t~ret7#1.offset|) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (let ((.cse7 (+ 8 |v_ULTIMATE.start_create_#t~mem8#1.offset_32|))) (let ((.cse0 (store .cse8 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse9 .cse7 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse6 .cse7 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse2 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (not (= v_ArrVal_2999 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2999 .cse2)))) (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (or (= (select (let ((.cse3 (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_3000)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< (select (select (store .cse0 .cse1 v_ArrVal_2999) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_32| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (let ((.cse15 (+ 8 |v_ULTIMATE.start_create_#t~mem8#1.offset_32|))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse9 .cse15 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (forall ((v_ArrVal_2999 (Array Int Int))) (let ((.cse12 (store .cse5 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse6 .cse15 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse14 (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (or (forall ((v_ArrVal_3000 Int) (|v_ULTIMATE.start_loop_~node~0#1.offset_44| Int)) (let ((.cse11 (store .cse10 .cse13 v_ArrVal_2999))) (or (< (select (select .cse11 |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) (= (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3000)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|)) |v_ULTIMATE.start_loop_~node~0#1.offset_44|) 0) (< |v_ULTIMATE.start_loop_~node~0#1.offset_44| 0)))) (not (= v_ArrVal_2999 (store (select .cse10 .cse13) .cse14 (select v_ArrVal_2999 .cse14)))))))))))) (< |v_ULTIMATE.start_create_#t~mem8#1.offset_32| |c_ULTIMATE.start_create_#t~ret7#1.offset|)))))) is different from false [2024-10-11 18:08:03,375 INFO L349 Elim1Store]: treesize reduction 459, result has 28.9 percent of original size [2024-10-11 18:08:03,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 1328241 treesize of output 597961 [2024-10-11 18:08:10,738 INFO L349 Elim1Store]: treesize reduction 589, result has 27.8 percent of original size [2024-10-11 18:08:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 44977 treesize of output 32788 [2024-10-11 18:08:14,896 INFO L349 Elim1Store]: treesize reduction 162, result has 69.5 percent of original size [2024-10-11 18:08:14,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 55 case distinctions, treesize of input 43032 treesize of output 32351 [2024-10-11 18:08:19,476 INFO L349 Elim1Store]: treesize reduction 1087, result has 27.3 percent of original size [2024-10-11 18:08:19,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 56 case distinctions, treesize of input 123232 treesize of output 100675 [2024-10-11 18:08:24,593 INFO L224 Elim1Store]: Index analysis took 157 ms [2024-10-11 18:08:25,780 INFO L349 Elim1Store]: treesize reduction 908, result has 27.3 percent of original size [2024-10-11 18:08:25,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 40261 treesize of output 39832 [2024-10-11 18:08:27,124 INFO L224 Elim1Store]: Index analysis took 175 ms [2024-10-11 18:08:29,074 INFO L349 Elim1Store]: treesize reduction 214, result has 73.9 percent of original size [2024-10-11 18:08:29,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 39548 treesize of output 39778