./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:32:55,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:32:55,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:32:55,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:32:55,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:32:55,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:32:55,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:32:55,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:32:55,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:32:55,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:32:55,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:32:55,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:32:55,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:32:55,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:32:55,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:32:55,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:55,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:55,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:55,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:32:55,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:32:55,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:32:55,327 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2025-01-09 22:32:55,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:32:55,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:32:55,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:32:55,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:32:55,597 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:32:55,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-01-09 22:32:56,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0014740/c16acbeebb544971a471c41bfcd7dba2/FLAG10251dc01 [2025-01-09 22:32:57,295 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:32:57,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-01-09 22:32:57,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0014740/c16acbeebb544971a471c41bfcd7dba2/FLAG10251dc01 [2025-01-09 22:32:57,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0014740/c16acbeebb544971a471c41bfcd7dba2 [2025-01-09 22:32:57,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:32:57,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:32:57,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:57,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:32:57,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:32:57,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57, skipping insertion in model container [2025-01-09 22:32:57,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:32:57,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:57,787 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:32:57,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:57,867 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:32:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57 WrapperNode [2025-01-09 22:32:57,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:57,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:57,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:32:57,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:32:57,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,906 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 76 [2025-01-09 22:32:57,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:57,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:32:57,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:32:57,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:32:57,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,935 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 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]. [2025-01-09 22:32:57,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:32:57,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:32:57,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:32:57,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:32:57,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (1/1) ... [2025-01-09 22:32:57,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:57,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:32:58,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:32:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-01-09 22:32:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-01-09 22:32:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-01-09 22:32:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:32:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:32:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:32:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:32:58,119 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:32:58,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:32:58,393 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-01-09 22:32:58,393 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:32:58,402 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:32:58,403 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:32:58,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:58 BoogieIcfgContainer [2025-01-09 22:32:58,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:32:58,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:32:58,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:32:58,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:32:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:57" (1/3) ... [2025-01-09 22:32:58,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4bf8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:58, skipping insertion in model container [2025-01-09 22:32:58,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:57" (2/3) ... [2025-01-09 22:32:58,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4bf8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:58, skipping insertion in model container [2025-01-09 22:32:58,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:58" (3/3) ... [2025-01-09 22:32:58,412 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2025-01-09 22:32:58,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:32:58,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll.i that has 4 procedures, 111 locations, 1 initial locations, 6 loop locations, and 39 error locations. [2025-01-09 22:32:58,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:32:58,469 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;@1e6f3b4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:32:58,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 22:32:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 101 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:32:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:58,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:58,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:58,480 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 36 more)] === [2025-01-09 22:32:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 37418459, now seen corresponding path program 1 times [2025-01-09 22:32:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467525160] [2025-01-09 22:32:58,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467525160] [2025-01-09 22:32:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467525160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:58,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:58,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215082284] [2025-01-09 22:32:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:58,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:58,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:58,731 INFO L87 Difference]: Start difference. First operand has 111 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 101 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-01-09 22:32:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:58,840 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-01-09 22:32:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:32:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:58,848 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:32:58,849 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:32:58,851 INFO L434 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 [2025-01-09 22:32:58,855 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:58,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:32:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 22:32:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 97 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:32:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2025-01-09 22:32:58,918 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 5 [2025-01-09 22:32:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2025-01-09 22:32:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-01-09 22:32:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2025-01-09 22:32:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:58,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:58,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:32:58,920 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 36 more)] === [2025-01-09 22:32:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 37418460, now seen corresponding path program 1 times [2025-01-09 22:32:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150071462] [2025-01-09 22:32:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:58,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150071462] [2025-01-09 22:32:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150071462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560756892] [2025-01-09 22:32:59,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:59,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:59,031 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-01-09 22:32:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,110 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-01-09 22:32:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:32:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,112 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:32:59,112 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:32:59,112 INFO L434 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 [2025-01-09 22:32:59,113 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:32:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 22:32:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:32:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-01-09 22:32:59,121 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 5 [2025-01-09 22:32:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,122 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-01-09 22:32:59,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-01-09 22:32:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-01-09 22:32:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:32:59,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:59,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:32:59,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:32:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 187245667, now seen corresponding path program 1 times [2025-01-09 22:32:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78542443] [2025-01-09 22:32:59,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:32:59,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:32:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78542443] [2025-01-09 22:32:59,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78542443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:59,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073903367] [2025-01-09 22:32:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:59,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:59,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:59,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:59,225 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,299 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-01-09 22:32:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-09 22:32:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,300 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:32:59,302 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:32:59,302 INFO L434 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 [2025-01-09 22:32:59,303 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:32:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:32:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.639344262295082) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:32:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-01-09 22:32:59,315 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 14 [2025-01-09 22:32:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,316 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-01-09 22:32:59,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-01-09 22:32:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:32:59,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:59,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:32:59,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:32:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 187245668, now seen corresponding path program 1 times [2025-01-09 22:32:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835033581] [2025-01-09 22:32:59,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:32:59,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:32:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835033581] [2025-01-09 22:32:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835033581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:59,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763741491] [2025-01-09 22:32:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:59,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:59,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:59,453 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,526 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-01-09 22:32:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-09 22:32:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,528 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:32:59,528 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:32:59,528 INFO L434 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 [2025-01-09 22:32:59,529 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:32:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:32:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:32:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2025-01-09 22:32:59,540 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 14 [2025-01-09 22:32:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,540 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2025-01-09 22:32:59,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2025-01-09 22:32:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:59,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,541 INFO L218 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] [2025-01-09 22:32:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:32:59,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:32:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -468009064, now seen corresponding path program 1 times [2025-01-09 22:32:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060235808] [2025-01-09 22:32:59,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:59,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:59,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060235808] [2025-01-09 22:32:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060235808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:32:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798864186] [2025-01-09 22:32:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:59,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:32:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:59,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:32:59,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:32:59,888 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:33:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:00,246 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-01-09 22:33:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-01-09 22:33:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:00,249 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:33:00,249 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:33:00,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:33:00,251 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:00,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 468 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:33:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:33:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2025-01-09 22:33:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 102 states have internal predecessors, (116), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2025-01-09 22:33:00,266 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 24 [2025-01-09 22:33:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:00,266 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2025-01-09 22:33:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:33:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2025-01-09 22:33:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:33:00,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:00,269 INFO L218 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] [2025-01-09 22:33:00,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:33:00,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -468009063, now seen corresponding path program 1 times [2025-01-09 22:33:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-01-09 22:33:00,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:33:00,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:33:00,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:00,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-01-09 22:33:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994031890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:00,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:33:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895073270] [2025-01-09 22:33:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:33:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:00,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:33:00,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:33:00,691 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:33:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:01,122 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2025-01-09 22:33:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:33:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-01-09 22:33:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:01,124 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:33:01,124 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:33:01,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:33:01,125 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:01,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 463 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:33:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:33:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2025-01-09 22:33:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 111 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 22:33:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2025-01-09 22:33:01,138 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 24 [2025-01-09 22:33:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2025-01-09 22:33:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:33:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2025-01-09 22:33:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:33:01,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:01,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:01,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:33:01,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:01,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 959835885, now seen corresponding path program 1 times [2025-01-09 22:33:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151292787] [2025-01-09 22:33:01,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:01,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:33:01,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:33:01,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151292787] [2025-01-09 22:33:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151292787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042360081] [2025-01-09 22:33:01,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:01,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:01,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:33:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:33:01,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:33:01,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:33:01,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:01,542 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 [2025-01-09 22:33:01,590 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:01,641 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:33:01,642 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 [2025-01-09 22:33:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:33:01,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042360081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:01,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:01,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-01-09 22:33:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335661952] [2025-01-09 22:33:01,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:01,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:33:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:33:01,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:33:01,711 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:02,052 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2025-01-09 22:33:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-01-09 22:33:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:02,053 INFO L225 Difference]: With dead ends: 127 [2025-01-09 22:33:02,053 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 22:33:02,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:33:02,054 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 505 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 334 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2025-01-09 22:33:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 22:33:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 22:33:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 111 states have internal predecessors, (128), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 22:33:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2025-01-09 22:33:02,066 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 27 [2025-01-09 22:33:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:02,066 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2025-01-09 22:33:02,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2025-01-09 22:33:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:33:02,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:02,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:02,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:33:02,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:02,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 959835886, now seen corresponding path program 1 times [2025-01-09 22:33:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959392792] [2025-01-09 22:33:02,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:02,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:33:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:33:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959392792] [2025-01-09 22:33:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959392792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299735851] [2025-01-09 22:33:02,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:02,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:02,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:33:02,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:33:02,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:33:02,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:02,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:02,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:33:02,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:02,685 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 [2025-01-09 22:33:02,786 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-01-09 22:33:02,817 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:02,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:33:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:33:02,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299735851] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:03,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-01-09 22:33:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022922949] [2025-01-09 22:33:03,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:03,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:33:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:03,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:33:03,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:33:03,073 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:03,626 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2025-01-09 22:33:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:33:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2025-01-09 22:33:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:03,628 INFO L225 Difference]: With dead ends: 128 [2025-01-09 22:33:03,628 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 22:33:03,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:33:03,629 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:03,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 684 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 354 Invalid, 0 Unknown, 116 Unchecked, 0.4s Time] [2025-01-09 22:33:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 22:33:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-01-09 22:33:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 110 states have internal predecessors, (126), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 22:33:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2025-01-09 22:33:03,641 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 27 [2025-01-09 22:33:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:03,641 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2025-01-09 22:33:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2025-01-09 22:33:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:33:03,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:03,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:03,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:03,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:03,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1346381796, now seen corresponding path program 1 times [2025-01-09 22:33:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635337237] [2025-01-09 22:33:03,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:33:03,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:33:03,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:03,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635337237] [2025-01-09 22:33:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635337237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:03,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:33:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619458790] [2025-01-09 22:33:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:33:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:03,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:33:03,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:33:03,937 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:04,082 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2025-01-09 22:33:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:33:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-01-09 22:33:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:04,084 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:33:04,084 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:33:04,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:33:04,085 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:04,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 335 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:33:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2025-01-09 22:33:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.556701030927835) internal successors, (151), 123 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 22:33:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 177 transitions. [2025-01-09 22:33:04,095 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 177 transitions. Word has length 31 [2025-01-09 22:33:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 177 transitions. [2025-01-09 22:33:04,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2025-01-09 22:33:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:33:04,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:04,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:04,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:33:04,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1346381797, now seen corresponding path program 1 times [2025-01-09 22:33:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568598990] [2025-01-09 22:33:04,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:04,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:33:04,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:33:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568598990] [2025-01-09 22:33:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568598990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:33:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137549743] [2025-01-09 22:33:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:04,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:33:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:04,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:33:04,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:33:04,321 INFO L87 Difference]: Start difference. First operand 141 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:04,494 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2025-01-09 22:33:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-01-09 22:33:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:04,495 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:33:04,495 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:33:04,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:33:04,496 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 22 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:04,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 611 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:33:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:33:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-01-09 22:33:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.5420560747663552) internal successors, (165), 133 states have internal predecessors, (165), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 22:33:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 191 transitions. [2025-01-09 22:33:04,501 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 191 transitions. Word has length 31 [2025-01-09 22:33:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:04,501 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 191 transitions. [2025-01-09 22:33:04,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 191 transitions. [2025-01-09 22:33:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:33:04,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:04,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:33:04,503 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 36 more)] === [2025-01-09 22:33:04,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1088429062, now seen corresponding path program 1 times [2025-01-09 22:33:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843264585] [2025-01-09 22:33:04,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:04,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:33:04,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:33:04,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:04,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:04,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:04,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843264585] [2025-01-09 22:33:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843264585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:04,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:33:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049637365] [2025-01-09 22:33:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:04,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:33:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:33:04,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:33:04,590 INFO L87 Difference]: Start difference. First operand 151 states and 191 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:04,642 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2025-01-09 22:33:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:33:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-01-09 22:33:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:04,644 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:33:04,644 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:33:04,644 INFO L434 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 [2025-01-09 22:33:04,645 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 27 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:04,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 650 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:33:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:33:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2025-01-09 22:33:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5185185185185186) internal successors, (164), 134 states have internal predecessors, (164), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 22:33:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 190 transitions. [2025-01-09 22:33:04,650 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 190 transitions. Word has length 33 [2025-01-09 22:33:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 190 transitions. [2025-01-09 22:33:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 190 transitions. [2025-01-09 22:33:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:33:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:04,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:33:04,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:04,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash -639463782, now seen corresponding path program 1 times [2025-01-09 22:33:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-01-09 22:33:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:33:04,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:33:04,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:04,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-01-09 22:33:05,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014114094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:05,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:05,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 22:33:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482111878] [2025-01-09 22:33:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:05,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:33:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:05,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:33:05,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:33:05,062 INFO L87 Difference]: Start difference. First operand 152 states and 190 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:05,501 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2025-01-09 22:33:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:33:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-01-09 22:33:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:05,503 INFO L225 Difference]: With dead ends: 168 [2025-01-09 22:33:05,503 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 22:33:05,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:33:05,503 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:05,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 880 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:33:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 22:33:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2025-01-09 22:33:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 141 states have internal predecessors, (173), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 22:33:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2025-01-09 22:33:05,512 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 34 [2025-01-09 22:33:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:05,512 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2025-01-09 22:33:05,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2025-01-09 22:33:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:33:05,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:05,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:05,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:33:05,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -639463781, now seen corresponding path program 1 times [2025-01-09 22:33:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114184770] [2025-01-09 22:33:05,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:05,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:33:05,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:33:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114184770] [2025-01-09 22:33:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114184770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 22:33:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765124186] [2025-01-09 22:33:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:06,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:33:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:06,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:33:06,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:33:06,051 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:06,474 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2025-01-09 22:33:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:33:06,474 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-01-09 22:33:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:06,475 INFO L225 Difference]: With dead ends: 168 [2025-01-09 22:33:06,475 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 22:33:06,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:33:06,476 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:06,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1009 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:33:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 22:33:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2025-01-09 22:33:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 141 states have internal predecessors, (172), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 22:33:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2025-01-09 22:33:06,483 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 34 [2025-01-09 22:33:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:06,483 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2025-01-09 22:33:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2025-01-09 22:33:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:33:06,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:06,487 INFO L218 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, 1, 1, 1, 1] [2025-01-09 22:33:06,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:33:06,487 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:06,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -270510592, now seen corresponding path program 1 times [2025-01-09 22:33:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:06,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299230168] [2025-01-09 22:33:06,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:06,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:33:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:33:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299230168] [2025-01-09 22:33:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299230168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499177891] [2025-01-09 22:33:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:06,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:06,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:33:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:33:07,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:33:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:07,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:33:07,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:07,066 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 [2025-01-09 22:33:07,138 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:07,166 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2025-01-09 22:33:07,168 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2025-01-09 22:33:07,209 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2025-01-09 22:33:07,212 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2025-01-09 22:33:07,343 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:07,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:33:07,363 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_7|))) (and (= (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from false [2025-01-09 22:33:07,367 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_7|))) (and (= (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from true [2025-01-09 22:33:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:33:07,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499177891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:07,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-01-09 22:33:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942114749] [2025-01-09 22:33:07,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:33:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:07,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:33:07,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2025-01-09 22:33:07,615 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:07,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-01-09 22:33:07,972 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)) |v_#valid_BEFORE_CALL_7|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-01-09 22:33:07,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)) |v_#valid_BEFORE_CALL_7|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-01-09 22:33:07,983 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_7|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)) |v_#valid_BEFORE_CALL_7|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-01-09 22:33:07,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_7|))) (and (= (store |v_#valid_BEFORE_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)) |v_#valid_BEFORE_CALL_7|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from false [2025-01-09 22:33:07,994 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_7|))) (and (= (store |v_#valid_BEFORE_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)) |v_#valid_BEFORE_CALL_7|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from true [2025-01-09 22:33:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:08,159 INFO L93 Difference]: Finished difference Result 177 states and 222 transitions. [2025-01-09 22:33:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:33:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-01-09 22:33:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:08,161 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:33:08,161 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 22:33:08,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2025-01-09 22:33:08,162 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:08,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 577 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 485 Invalid, 0 Unknown, 743 Unchecked, 0.4s Time] [2025-01-09 22:33:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 22:33:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2025-01-09 22:33:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 149 states have internal predecessors, (182), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2025-01-09 22:33:08,170 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 36 [2025-01-09 22:33:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:08,170 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2025-01-09 22:33:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2025-01-09 22:33:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:33:08,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:08,171 INFO L218 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, 1, 1, 1, 1] [2025-01-09 22:33:08,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:33:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:08,376 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -270510591, now seen corresponding path program 1 times [2025-01-09 22:33:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224476417] [2025-01-09 22:33:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:08,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:33:08,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:33:08,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:08,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224476417] [2025-01-09 22:33:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224476417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037347580] [2025-01-09 22:33:08,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:08,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:08,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:08,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:08,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:33:08,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:33:08,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:33:08,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:08,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:08,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:33:08,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:08,994 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 [2025-01-09 22:33:09,001 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 [2025-01-09 22:33:09,186 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:09,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:09,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-01-09 22:33:09,356 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:33:09,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-09 22:33:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:09,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037347580] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:09,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2025-01-09 22:33:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584134834] [2025-01-09 22:33:09,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:09,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:33:09,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:09,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:33:09,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:33:09,583 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 22:33:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:10,127 INFO L93 Difference]: Finished difference Result 189 states and 239 transitions. [2025-01-09 22:33:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:33:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 36 [2025-01-09 22:33:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:10,129 INFO L225 Difference]: With dead ends: 189 [2025-01-09 22:33:10,129 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 22:33:10,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=378, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:33:10,130 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 33 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:10,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 593 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 153 Unchecked, 0.5s Time] [2025-01-09 22:33:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 22:33:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2025-01-09 22:33:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2025-01-09 22:33:10,137 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 36 [2025-01-09 22:33:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2025-01-09 22:33:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 22:33:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2025-01-09 22:33:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:33:10,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:10,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:10,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:33:10,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 531619717, now seen corresponding path program 1 times [2025-01-09 22:33:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354049634] [2025-01-09 22:33:10,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:33:10,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:33:10,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:10,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354049634] [2025-01-09 22:33:10,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354049634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659215498] [2025-01-09 22:33:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:10,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:10,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:10,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:33:10,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:33:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:33:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:10,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:33:10,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:10,667 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 [2025-01-09 22:33:10,684 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 [2025-01-09 22:33:10,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:33:10,703 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:10,722 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:10,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:33:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:10,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659215498] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:10,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-01-09 22:33:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202928167] [2025-01-09 22:33:10,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:33:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:10,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:33:10,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-01-09 22:33:10,857 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:33:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:11,269 INFO L93 Difference]: Finished difference Result 173 states and 220 transitions. [2025-01-09 22:33:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:33:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-01-09 22:33:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:11,270 INFO L225 Difference]: With dead ends: 173 [2025-01-09 22:33:11,270 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 22:33:11,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:33:11,271 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:11,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 664 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 436 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2025-01-09 22:33:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 22:33:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-09 22:33:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 153 states have internal predecessors, (190), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2025-01-09 22:33:11,280 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 39 [2025-01-09 22:33:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:11,280 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2025-01-09 22:33:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:33:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2025-01-09 22:33:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:33:11,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:11,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:11,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:33:11,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 22:33:11,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:11,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash 531619718, now seen corresponding path program 1 times [2025-01-09 22:33:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520363035] [2025-01-09 22:33:11,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:11,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:33:11,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:33:11,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520363035] [2025-01-09 22:33:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520363035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505406843] [2025-01-09 22:33:11,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:11,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:11,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:11,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:11,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:33:11,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:33:11,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:33:11,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:11,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:11,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:33:11,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:11,941 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 [2025-01-09 22:33:11,945 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 [2025-01-09 22:33:12,028 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 [2025-01-09 22:33:12,033 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 [2025-01-09 22:33:12,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:33:12,169 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:12,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:12,190 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 [2025-01-09 22:33:12,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:12,199 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 [2025-01-09 22:33:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:12,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505406843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:12,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:12,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-01-09 22:33:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502857807] [2025-01-09 22:33:12,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:12,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:33:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:12,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:33:12,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:33:12,317 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:12,882 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2025-01-09 22:33:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:33:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2025-01-09 22:33:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:12,884 INFO L225 Difference]: With dead ends: 172 [2025-01-09 22:33:12,884 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 22:33:12,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=562, Unknown=1, NotChecked=48, Total=702 [2025-01-09 22:33:12,884 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 18 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:12,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 862 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 728 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2025-01-09 22:33:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 22:33:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-09 22:33:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 152 states have internal predecessors, (189), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2025-01-09 22:33:12,895 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 39 [2025-01-09 22:33:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:12,895 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2025-01-09 22:33:12,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2025-01-09 22:33:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:33:12,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:12,896 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:33:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:33:13,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:13,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2085535188, now seen corresponding path program 1 times [2025-01-09 22:33:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454633780] [2025-01-09 22:33:13,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:33:13,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:33:13,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:13,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454633780] [2025-01-09 22:33:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454633780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877818871] [2025-01-09 22:33:13,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:13,881 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:13,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:33:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:33:13,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:33:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:13,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:13,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 22:33:13,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:13,991 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 [2025-01-09 22:33:14,115 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 [2025-01-09 22:33:14,121 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 [2025-01-09 22:33:14,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:14,342 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 [2025-01-09 22:33:14,408 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 33 treesize of output 17 [2025-01-09 22:33:14,424 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 33 treesize of output 17 [2025-01-09 22:33:14,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:14,765 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-01-09 22:33:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2025-01-09 22:33:14,776 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:33:14,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2025-01-09 22:33:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:14,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:15,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:15,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1600 treesize of output 1534 [2025-01-09 22:33:15,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:15,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1586 treesize of output 1610 [2025-01-09 22:33:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877818871] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:31,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2025-01-09 22:33:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759776920] [2025-01-09 22:33:31,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:31,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:33:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:31,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:33:31,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1620, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:33:31,419 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:32,550 INFO L93 Difference]: Finished difference Result 177 states and 225 transitions. [2025-01-09 22:33:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:33:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2025-01-09 22:33:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:32,552 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:33:32,552 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 22:33:32,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=170, Invalid=2586, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:33:32,554 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 27 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:32,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1950 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:33:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 22:33:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2025-01-09 22:33:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2025-01-09 22:33:32,561 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 37 [2025-01-09 22:33:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:32,562 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2025-01-09 22:33:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2025-01-09 22:33:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:33:32,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:32,563 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:32,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:32,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:32,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -48681601, now seen corresponding path program 1 times [2025-01-09 22:33:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953821320] [2025-01-09 22:33:32,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:32,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:33:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:33:32,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:33,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953821320] [2025-01-09 22:33:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953821320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251871929] [2025-01-09 22:33:33,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:33,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:33,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:33,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:33:33,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:33:33,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:33:33,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:33,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:33,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:33:33,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:33,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:33:33,620 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 20 treesize of output 8 [2025-01-09 22:33:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:33,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:33:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251871929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:33,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:33:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2025-01-09 22:33:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459418397] [2025-01-09 22:33:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:33:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:33,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:33:33,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:33:33,658 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:33,867 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2025-01-09 22:33:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:33:33,867 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-01-09 22:33:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:33,869 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:33:33,869 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:33:33,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:33:33,870 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:33,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1008 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:33:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:33:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2025-01-09 22:33:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.446969696969697) internal successors, (191), 155 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2025-01-09 22:33:33,878 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 38 [2025-01-09 22:33:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2025-01-09 22:33:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2025-01-09 22:33:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:33:33,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:33,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:33,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:34,080 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -228603887, now seen corresponding path program 1 times [2025-01-09 22:33:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847011070] [2025-01-09 22:33:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:33:34,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:33:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847011070] [2025-01-09 22:33:34,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847011070] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142314252] [2025-01-09 22:33:34,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:34,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:34,724 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:34,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:33:34,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:33:34,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:33:34,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:34,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:34,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 22:33:34,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:34,818 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 [2025-01-09 22:33:34,841 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 [2025-01-09 22:33:34,848 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 [2025-01-09 22:33:34,879 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 [2025-01-09 22:33:34,886 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 [2025-01-09 22:33:35,044 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-01-09 22:33:35,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:35,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:33:35,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:33:35,113 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:35,113 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 [2025-01-09 22:33:35,161 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 22:33:35,161 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 [2025-01-09 22:33:35,176 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 22:33:35,176 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 [2025-01-09 22:33:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:35,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142314252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:35,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2025-01-09 22:33:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572141441] [2025-01-09 22:33:35,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:35,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:33:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:33:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1023, Unknown=1, NotChecked=64, Total=1190 [2025-01-09 22:33:35,800 INFO L87 Difference]: Start difference. First operand 175 states and 221 transitions. Second operand has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:33:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:36,429 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2025-01-09 22:33:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:33:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-01-09 22:33:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:36,430 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:33:36,430 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:33:36,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=1649, Unknown=1, NotChecked=82, Total=1892 [2025-01-09 22:33:36,431 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 16 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:36,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1327 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 788 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2025-01-09 22:33:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:33:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2025-01-09 22:33:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 159 states have internal predecessors, (195), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2025-01-09 22:33:36,437 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 41 [2025-01-09 22:33:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:36,437 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2025-01-09 22:33:36,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:33:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2025-01-09 22:33:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:33:36,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:36,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:36,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:33:36,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:36,639 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash -644324109, now seen corresponding path program 1 times [2025-01-09 22:33:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164655325] [2025-01-09 22:33:36,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:36,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:33:36,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:33:36,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:36,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164655325] [2025-01-09 22:33:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164655325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:36,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:33:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742890649] [2025-01-09 22:33:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:36,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:33:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:36,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:33:36,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:33:36,708 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:36,868 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2025-01-09 22:33:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:33:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-09 22:33:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:36,870 INFO L225 Difference]: With dead ends: 215 [2025-01-09 22:33:36,870 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 22:33:36,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:33:36,871 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:36,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 356 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 22:33:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2025-01-09 22:33:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.457516339869281) internal successors, (223), 175 states have internal predecessors, (223), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2025-01-09 22:33:36,878 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 43 [2025-01-09 22:33:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:36,878 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2025-01-09 22:33:36,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2025-01-09 22:33:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:33:36,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:36,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:33:36,879 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -644324108, now seen corresponding path program 1 times [2025-01-09 22:33:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676603337] [2025-01-09 22:33:36,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:36,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:33:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:33:36,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:36,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676603337] [2025-01-09 22:33:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676603337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677731814] [2025-01-09 22:33:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:37,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:37,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:33:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:33:37,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:33:37,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:37,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:37,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 22:33:37,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:37,169 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 [2025-01-09 22:33:37,173 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 [2025-01-09 22:33:37,402 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:33:37,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:33:37,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:37,412 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 [2025-01-09 22:33:37,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:33:37,542 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:37,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-09 22:33:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:37,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677731814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:37,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 26 [2025-01-09 22:33:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841728937] [2025-01-09 22:33:37,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:33:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:37,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:33:37,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:33:37,882 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 27 states, 25 states have (on average 2.68) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:38,602 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2025-01-09 22:33:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:33:38,602 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2025-01-09 22:33:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:38,603 INFO L225 Difference]: With dead ends: 234 [2025-01-09 22:33:38,603 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 22:33:38,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1584, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:33:38,605 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:38,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1336 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:33:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 22:33:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 219. [2025-01-09 22:33:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 199 states have internal predecessors, (260), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2025-01-09 22:33:38,614 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 43 [2025-01-09 22:33:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:38,615 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2025-01-09 22:33:38,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2025-01-09 22:33:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:33:38,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:38,616 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:38,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:38,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:38,817 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2135431628, now seen corresponding path program 1 times [2025-01-09 22:33:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445777496] [2025-01-09 22:33:38,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:38,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:38,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:38,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:38,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:39,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445777496] [2025-01-09 22:33:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445777496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:33:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995302462] [2025-01-09 22:33:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:39,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:33:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:39,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:33:39,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:33:39,015 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:39,291 INFO L93 Difference]: Finished difference Result 219 states and 287 transitions. [2025-01-09 22:33:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:33:39,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-01-09 22:33:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:39,293 INFO L225 Difference]: With dead ends: 219 [2025-01-09 22:33:39,293 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:33:39,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:33:39,294 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 582 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:33:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:33:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-01-09 22:33:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4519774011299436) internal successors, (257), 199 states have internal predecessors, (257), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 287 transitions. [2025-01-09 22:33:39,300 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 287 transitions. Word has length 51 [2025-01-09 22:33:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 287 transitions. [2025-01-09 22:33:39,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 287 transitions. [2025-01-09 22:33:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:33:39,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:39,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:39,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:33:39,301 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2135431629, now seen corresponding path program 1 times [2025-01-09 22:33:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73313834] [2025-01-09 22:33:39,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:39,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:39,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73313834] [2025-01-09 22:33:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73313834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:33:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755159030] [2025-01-09 22:33:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:33:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:33:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:33:39,617 INFO L87 Difference]: Start difference. First operand 219 states and 287 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:39,849 INFO L93 Difference]: Finished difference Result 219 states and 284 transitions. [2025-01-09 22:33:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:33:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-01-09 22:33:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:39,851 INFO L225 Difference]: With dead ends: 219 [2025-01-09 22:33:39,851 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:33:39,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:33:39,852 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:39,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 475 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:33:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:33:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-01-09 22:33:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4350282485875707) internal successors, (254), 199 states have internal predecessors, (254), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2025-01-09 22:33:39,859 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 51 [2025-01-09 22:33:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2025-01-09 22:33:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2025-01-09 22:33:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:33:39,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:39,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:33:39,860 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1500822950, now seen corresponding path program 1 times [2025-01-09 22:33:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736683276] [2025-01-09 22:33:39,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:39,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:33:39,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:33:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736683276] [2025-01-09 22:33:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736683276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:33:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062269079] [2025-01-09 22:33:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:39,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:33:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:39,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:33:39,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:33:39,943 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:40,008 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2025-01-09 22:33:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:40,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-01-09 22:33:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:40,010 INFO L225 Difference]: With dead ends: 228 [2025-01-09 22:33:40,010 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 22:33:40,010 INFO L434 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 [2025-01-09 22:33:40,010 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:40,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 668 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 22:33:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2025-01-09 22:33:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.423728813559322) internal successors, (252), 199 states have internal predecessors, (252), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2025-01-09 22:33:40,016 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 44 [2025-01-09 22:33:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:40,016 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2025-01-09 22:33:40,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:33:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2025-01-09 22:33:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:33:40,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:40,017 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:40,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:33:40,017 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:40,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash 822952706, now seen corresponding path program 1 times [2025-01-09 22:33:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391504635] [2025-01-09 22:33:40,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:40,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:40,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:40,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:40,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:33:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391504635] [2025-01-09 22:33:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391504635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017559638] [2025-01-09 22:33:40,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:40,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:40,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:33:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:40,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:33:40,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:40,518 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 19 treesize of output 1 [2025-01-09 22:33:40,577 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 21 treesize of output 9 [2025-01-09 22:33:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:33:40,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:40,598 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 28 [2025-01-09 22:33:40,683 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:33:40,683 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 [2025-01-09 22:33:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:33:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017559638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:40,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:40,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 21 [2025-01-09 22:33:40,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029855914] [2025-01-09 22:33:40,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:40,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:33:40,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:40,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:33:40,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:33:40,700 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 22:33:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:41,041 INFO L93 Difference]: Finished difference Result 237 states and 302 transitions. [2025-01-09 22:33:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:33:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2025-01-09 22:33:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:41,042 INFO L225 Difference]: With dead ends: 237 [2025-01-09 22:33:41,042 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 22:33:41,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:33:41,042 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 39 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:41,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1341 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:33:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 22:33:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2025-01-09 22:33:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4130434782608696) internal successors, (260), 206 states have internal predecessors, (260), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2025-01-09 22:33:41,048 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 46 [2025-01-09 22:33:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2025-01-09 22:33:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 22:33:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2025-01-09 22:33:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:33:41,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:41,051 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:41,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:33:41,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:33:41,255 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:41,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash 822952707, now seen corresponding path program 1 times [2025-01-09 22:33:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625871252] [2025-01-09 22:33:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:41,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:41,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:41,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:41,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625871252] [2025-01-09 22:33:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625871252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106388042] [2025-01-09 22:33:41,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:41,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:41,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:41,852 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:41,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:33:41,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:41,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 22:33:41,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:42,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:33:42,173 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 19 treesize of output 1 [2025-01-09 22:33:42,297 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 21 treesize of output 9 [2025-01-09 22:33:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:42,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:42,537 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 30 treesize of output 24 [2025-01-09 22:33:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:42,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:42,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:42,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:42,692 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 19 treesize of output 23 [2025-01-09 22:33:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106388042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:42,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 47 [2025-01-09 22:33:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903602225] [2025-01-09 22:33:42,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:42,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:33:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:33:42,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2112, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:33:42,830 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 22:33:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:43,746 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2025-01-09 22:33:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:33:43,746 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2025-01-09 22:33:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:43,748 INFO L225 Difference]: With dead ends: 236 [2025-01-09 22:33:43,748 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 22:33:43,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 22:33:43,749 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 89 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:43,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1506 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:33:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 22:33:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2025-01-09 22:33:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 206 states have internal predecessors, (259), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-01-09 22:33:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 289 transitions. [2025-01-09 22:33:43,758 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 289 transitions. Word has length 46 [2025-01-09 22:33:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:43,758 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 289 transitions. [2025-01-09 22:33:43,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 22:33:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 289 transitions. [2025-01-09 22:33:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:33:43,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:43,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:43,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:43,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:43,962 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 657428584, now seen corresponding path program 2 times [2025-01-09 22:33:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:43,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311333644] [2025-01-09 22:33:43,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:43,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:33:43,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:33:43,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:43,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:33:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311333644] [2025-01-09 22:33:44,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311333644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083815201] [2025-01-09 22:33:44,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:44,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:44,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:33:44,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:33:45,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:33:45,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:45,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 22:33:45,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:45,015 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 [2025-01-09 22:33:45,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)) |v_old(#valid)_AFTER_CALL_47|) (= .cse1 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse1 (select |c_#valid| .cse1)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from false [2025-01-09 22:33:45,157 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)) |v_old(#valid)_AFTER_CALL_47|) (= .cse1 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse1 (select |c_#valid| .cse1)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from true [2025-01-09 22:33:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:33:45,198 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) (or (and .cse0 (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)) |v_old(#valid)_AFTER_CALL_47|) (= .cse4 .cse2) (= c_create_internal_~now~0.base .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse1)) .cse0)))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from false [2025-01-09 22:33:45,203 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) (or (and .cse0 (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)) |v_old(#valid)_AFTER_CALL_47|) (= .cse4 .cse2) (= c_create_internal_~now~0.base .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse1)) .cse0)))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from true [2025-01-09 22:33:45,244 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 92 treesize of output 80 [2025-01-09 22:33:45,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse2))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1))) (.cse1 (= |c_#valid| (store |c_old(#valid)| .cse2 .cse5)))) (or (and .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse3) 1) (= |c_create_internal_#t~mem8.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (and (or (and (= |c_#valid| |c_old(#valid)|) .cse0) (= .cse5 1)) .cse1))))) is different from false [2025-01-09 22:33:45,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse2))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1))) (.cse1 (= |c_#valid| (store |c_old(#valid)| .cse2 .cse5)))) (or (and .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse3) 1) (= |c_create_internal_#t~mem8.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (and (or (and (= |c_#valid| |c_old(#valid)|) .cse0) (= .cse5 1)) .cse1))))) is different from true [2025-01-09 22:33:45,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1))) (.cse1 (= |c_#valid| (store |c_old(#valid)| .cse2 .cse3)))) (or (and .cse0 .cse1 (= c_create_internal_~now~0.base .cse2)) (and (or (and (= |c_#valid| |c_old(#valid)|) .cse0) (= .cse3 1)) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse4) 1) (= .cse5 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))))))) is different from false [2025-01-09 22:33:45,328 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1))) (.cse1 (= |c_#valid| (store |c_old(#valid)| .cse2 .cse3)))) (or (and .cse0 .cse1 (= c_create_internal_~now~0.base .cse2)) (and (or (and (= |c_#valid| |c_old(#valid)|) .cse0) (= .cse3 1)) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse4) 1) (= .cse5 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))))))) is different from true [2025-01-09 22:33:45,378 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:45,430 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)) |v_old(#valid)_AFTER_CALL_47|) (= .cse1 c_create_internal_~now~0.base) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= .cse2 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_48| .cse2))))))) is different from false [2025-01-09 22:33:45,433 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)) |v_old(#valid)_AFTER_CALL_47|) (= .cse1 c_create_internal_~now~0.base) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= .cse2 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_48| .cse2))))))) is different from true [2025-01-09 22:33:45,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (= (select |c_#valid| .cse1) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_47| .cse2)) |v_old(#valid)_AFTER_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_48| .cse3))) (= 1 (select |c_#valid| .cse3)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))))) is different from false [2025-01-09 22:33:45,488 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (= (select |c_#valid| .cse1) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_47| .cse2)) |v_old(#valid)_AFTER_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_48| .cse3))) (= 1 (select |c_#valid| .cse3)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))))) is different from true [2025-01-09 22:33:45,767 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-01-09 22:33:45,768 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 3 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 22:33:45,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_49| (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |v_old(#valid)_AFTER_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)) |v_old(#valid)_AFTER_CALL_48|) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) .cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_47|))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_48| .cse3))) (= 1 (select |c_#valid| .cse3)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_47| (store |v_old(#valid)_AFTER_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_47| .cse2)))))))))) is different from false [2025-01-09 22:33:45,918 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_49| (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |v_old(#valid)_AFTER_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_48| .cse1)) |v_old(#valid)_AFTER_CALL_48|) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) .cse0 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_47|))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_48| .cse3))) (= 1 (select |c_#valid| .cse3)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_47| (store |v_old(#valid)_AFTER_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_47| .cse2)))))))))) is different from true [2025-01-09 22:33:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2025-01-09 22:33:45,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083815201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:46,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2025-01-09 22:33:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021118884] [2025-01-09 22:33:46,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:33:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:46,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:33:46,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=490, Unknown=15, NotChecked=424, Total=1056 [2025-01-09 22:33:46,210 INFO L87 Difference]: Start difference. First operand 226 states and 289 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 22 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:46,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse11))) (let ((.cse5 (@diff .cse17 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse5))) (let ((.cse16 (store .cse17 .cse5 .cse12))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse4 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse13 (select |c_#valid| .cse14)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse15 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse10 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 .cse4 .cse1) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= .cse9 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))))) (and (or .cse0 .cse10) .cse7) (and .cse4 .cse7)) (or .cse0 .cse1 (= .cse11 1)) (or (= .cse12 1) .cse6 .cse7) (or (= .cse13 1) (= (select |c_old(#valid)| .cse14) 0) .cse15) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (= |c_#valid| (store .cse16 .cse14 .cse13)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse3) .cse6 .cse7) .cse15 (or .cse0 .cse1 .cse10)))))))))) is different from false [2025-01-09 22:33:46,637 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse11))) (let ((.cse5 (@diff .cse17 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse5))) (let ((.cse16 (store .cse17 .cse5 .cse12))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse4 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse13 (select |c_#valid| .cse14)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse15 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse10 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 .cse4 .cse1) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= .cse9 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))))) (and (or .cse0 .cse10) .cse7) (and .cse4 .cse7)) (or .cse0 .cse1 (= .cse11 1)) (or (= .cse12 1) .cse6 .cse7) (or (= .cse13 1) (= (select |c_old(#valid)| .cse14) 0) .cse15) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (= |c_#valid| (store .cse16 .cse14 .cse13)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse3) .cse6 .cse7) .cse15 (or .cse0 .cse1 .cse10)))))))))) is different from true [2025-01-09 22:33:46,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse14))) (let ((.cse16 (store |c_old(#valid)| .cse14 .cse3))) (let ((.cse15 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse15))) (let ((.cse10 (store .cse16 .cse15 .cse4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse2 (= .cse14 .cse13)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse5 (= (select |c_old(#valid)| .cse15) 0)) (.cse6 (= |c_#valid| .cse16)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (and .cse6 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse11 (select |v_old(#valid)_AFTER_CALL_47| .cse11)) |v_old(#valid)_AFTER_CALL_47|) (= .cse12 .cse13) (= c_create_internal_~now~0.base .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse12 (select |c_#valid| .cse12)))))) (and (or .cse0 (= c_create_internal_~now~0.base .cse14)) .cse6)) (or (= .cse15 .cse13) .cse5 .cse6) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from false [2025-01-09 22:33:46,653 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse14))) (let ((.cse16 (store |c_old(#valid)| .cse14 .cse3))) (let ((.cse15 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse15))) (let ((.cse10 (store .cse16 .cse15 .cse4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse2 (= .cse14 .cse13)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse5 (= (select |c_old(#valid)| .cse15) 0)) (.cse6 (= |c_#valid| .cse16)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (and .cse6 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse11 (select |v_old(#valid)_AFTER_CALL_47| .cse11)) |v_old(#valid)_AFTER_CALL_47|) (= .cse12 .cse13) (= c_create_internal_~now~0.base .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse12 (select |c_#valid| .cse12)))))) (and (or .cse0 (= c_create_internal_~now~0.base .cse14)) .cse6)) (or (= .cse15 .cse13) .cse5 .cse6) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from true [2025-01-09 22:33:46,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse16 (select |c_#valid| .cse17))) (let ((.cse15 (store |c_old(#valid)| .cse17 .cse16))) (let ((.cse3 (@diff .cse15 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse3))) (let ((.cse14 (store .cse15 .cse3 .cse10))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse17) 0)) (.cse2 (= |c_create_internal_#t~mem8.base| .cse17)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= .cse16 1)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse11 (select |c_#valid| .cse12)) (.cse13 (= |c_#valid| .cse14))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 .cse6) (let ((.cse7 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse7 .cse5 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse8) 1) (= |c_create_internal_#t~mem8.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))))) (and (or (and .cse0 .cse7) .cse6) .cse5))) (or (= .cse10 1) .cse4 .cse5) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) .cse13))))))))) is different from false [2025-01-09 22:33:46,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse16 (select |c_#valid| .cse17))) (let ((.cse15 (store |c_old(#valid)| .cse17 .cse16))) (let ((.cse3 (@diff .cse15 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse3))) (let ((.cse14 (store .cse15 .cse3 .cse10))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse17) 0)) (.cse2 (= |c_create_internal_#t~mem8.base| .cse17)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= .cse16 1)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse11 (select |c_#valid| .cse12)) (.cse13 (= |c_#valid| .cse14))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 .cse6) (let ((.cse7 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse7 .cse5 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse8) 1) (= |c_create_internal_#t~mem8.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))))) (and (or (and .cse0 .cse7) .cse6) .cse5))) (or (= .cse10 1) .cse4 .cse5) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) .cse13))))))))) is different from true [2025-01-09 22:33:46,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse8 (= |c_#valid| .cse9)) (.cse2 (= .cse17 1)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0)) (.cse12 (= c_create_internal_~now~0.base .cse15))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (let ((.cse11 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse11 .cse5 .cse12) (and (or (and .cse0 .cse11) .cse2) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_47| .cse13)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse13) 1) (= .cse14 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse14 (select |c_#valid| .cse14)))))))) (or .cse0 .cse1 .cse12)))))))))) is different from false [2025-01-09 22:33:46,682 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse8 (= |c_#valid| .cse9)) (.cse2 (= .cse17 1)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0)) (.cse12 (= c_create_internal_~now~0.base .cse15))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (let ((.cse11 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse11 .cse5 .cse12) (and (or (and .cse0 .cse11) .cse2) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_47| .cse13)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse13) 1) (= .cse14 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse14 (select |c_#valid| .cse14)))))))) (or .cse0 .cse1 .cse12)))))))))) is different from true [2025-01-09 22:33:46,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse9))) (let ((.cse2 (store |c_old(#valid)| .cse9 .cse6))) (let ((.cse0 (@diff .cse2 |c_#valid|)) (.cse1 (= |c_#valid| .cse2)) (.cse5 (= |c_#valid| |c_old(#valid)|)) (.cse4 (= c_create_internal_~now~0.base .cse9))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (= |c_#valid| (store .cse2 .cse0 (select |c_#valid| .cse0))) (let ((.cse3 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse3 .cse1 .cse4) (and (or (and .cse5 .cse3) (= .cse6 1)) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse7 (select |v_old(#valid)_AFTER_CALL_47| .cse7)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse7) 1) (= .cse8 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse8 (select |c_#valid| .cse8)))))))) (or .cse5 (= (select |c_old(#valid)| .cse9) 0) .cse4)))))) is different from false [2025-01-09 22:33:46,694 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse9))) (let ((.cse2 (store |c_old(#valid)| .cse9 .cse6))) (let ((.cse0 (@diff .cse2 |c_#valid|)) (.cse1 (= |c_#valid| .cse2)) (.cse5 (= |c_#valid| |c_old(#valid)|)) (.cse4 (= c_create_internal_~now~0.base .cse9))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (= |c_#valid| (store .cse2 .cse0 (select |c_#valid| .cse0))) (let ((.cse3 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)))) (or (and .cse3 .cse1 .cse4) (and (or (and .cse5 .cse3) (= .cse6 1)) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (and (= (store |c_old(#valid)| .cse7 (select |v_old(#valid)_AFTER_CALL_47| .cse7)) |v_old(#valid)_AFTER_CALL_47|) (= (select |c_#valid| .cse7) 1) (= .cse8 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_47| .cse8 (select |c_#valid| .cse8)))))))) (or .cse5 (= (select |c_old(#valid)| .cse9) 0) .cse4)))))) is different from true [2025-01-09 22:33:46,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= .cse9 c_create_internal_~now~0.base) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |v_old(#valid)_AFTER_CALL_48| .cse9)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= .cse10 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_48| .cse10)))))))))))))))) is different from false [2025-01-09 22:33:46,817 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)) |v_old(#valid)_AFTER_CALL_47|) (= .cse9 c_create_internal_~now~0.base) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |v_old(#valid)_AFTER_CALL_48| .cse9)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (exists ((v_create_internal_~now~0.base_43 Int)) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= .cse10 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_48| .cse10)))))))))))))))) is different from true [2025-01-09 22:33:46,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (let ((.cse8 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse8 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and .cse8 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse9 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (= (select |c_#valid| .cse9) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse9 (select |v_old(#valid)_AFTER_CALL_48| .cse9)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)) |v_old(#valid)_AFTER_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_48| .cse11))) (= 1 (select |c_#valid| .cse11)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))))))))))))))) is different from false [2025-01-09 22:33:46,867 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (let ((.cse8 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse8 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and .cse8 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse9 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_48|))) (and (= (select |c_#valid| .cse9) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_48| (store |c_old(#valid)| .cse9 (select |v_old(#valid)_AFTER_CALL_48| .cse9)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_47|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)) |v_old(#valid)_AFTER_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_48| .cse11))) (= 1 (select |c_#valid| .cse11)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))))))))))))))) is different from true [2025-01-09 22:33:46,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_49| (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |v_old(#valid)_AFTER_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_48| .cse2)) |v_old(#valid)_AFTER_CALL_48|) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1)))))) (and .cse0 .cse1 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_47|))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_48| .cse4))) (= 1 (select |c_#valid| .cse4)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_47| (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)))))))))))) is different from false [2025-01-09 22:33:46,910 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_49| (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|) 1) |v_old(#valid)_AFTER_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)))) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_create_internal_~now~0.base_43 Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_48|))) (and (= (store |v_old(#valid)_AFTER_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_48| .cse2)) |v_old(#valid)_AFTER_CALL_48|) (= 1 (select |v_old(#valid)_AFTER_CALL_48| v_create_internal_~now~0.base_43)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1)))))) (and .cse0 .cse1 (exists ((v_create_internal_~now~0.base_43 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_43) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |v_old(#valid)_AFTER_CALL_48|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |v_old(#valid)_AFTER_CALL_47|))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_48| (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_48| .cse4))) (= 1 (select |c_#valid| .cse4)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_48| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_47| (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |v_old(#valid)_AFTER_CALL_47| .cse3)))))))))))) is different from true [2025-01-09 22:33:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:47,133 INFO L93 Difference]: Finished difference Result 252 states and 327 transitions. [2025-01-09 22:33:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:33:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 22 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 48 [2025-01-09 22:33:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:47,135 INFO L225 Difference]: With dead ends: 252 [2025-01-09 22:33:47,135 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 22:33:47,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=731, Unknown=31, NotChecked=1168, Total=2162 [2025-01-09 22:33:47,136 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1666 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:47,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 803 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 645 Invalid, 0 Unknown, 1666 Unchecked, 0.6s Time] [2025-01-09 22:33:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 22:33:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2025-01-09 22:33:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.4145077720207253) internal successors, (273), 213 states have internal predecessors, (273), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 22:33:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 309 transitions. [2025-01-09 22:33:47,142 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 309 transitions. Word has length 48 [2025-01-09 22:33:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:47,142 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 309 transitions. [2025-01-09 22:33:47,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 22 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 309 transitions. [2025-01-09 22:33:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:33:47,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:47,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:47,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:33:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:33:47,344 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:33:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash 657428585, now seen corresponding path program 2 times [2025-01-09 22:33:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630001807] [2025-01-09 22:33:47,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:47,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:33:47,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:33:47,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:47,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:33:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630001807] [2025-01-09 22:33:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630001807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249761445] [2025-01-09 22:33:48,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:48,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:48,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:48,125 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:48,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:33:48,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:33:48,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:33:48,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:48,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:48,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:33:48,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:48,248 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 [2025-01-09 22:33:48,252 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 [2025-01-09 22:33:48,335 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:48,463 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 [2025-01-09 22:33:48,511 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 108 treesize of output 64 [2025-01-09 22:33:48,575 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= |c_#length| (store |c_old(#length)| create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base))) (= |c_#valid| (store |c_old(#valid)| create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))))) (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base)) create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))) (= (store (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base)) |c_#length|)))))) is different from true [2025-01-09 22:33:48,652 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:50,228 INFO L349 Elim1Store]: treesize reduction 312, result has 11.6 percent of original size [2025-01-09 22:33:50,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 171 treesize of output 516 [2025-01-09 22:33:50,491 INFO L224 Elim1Store]: Index analysis took 192 ms [2025-01-09 22:33:52,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:52,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 203 treesize of output 705