./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-reverse_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/forester-heap/sll-reverse_simple.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:37:33,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:37:33,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:37:33,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:37:33,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:37:33,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:37:33,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:37:33,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:37:33,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:37:33,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:37:33,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:37:33,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:37:33,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:37:33,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:37:33,571 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:37:33,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:37:33,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:33,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:37:33,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:33,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:37:33,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:37:33,573 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba [2025-01-09 22:37:33,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:37:33,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:37:33,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:37:33,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:37:33,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:37:33,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2025-01-09 22:37:34,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bc08f315/8eb52b7057794e9fb50298ba7a230010/FLAGe057cf257 [2025-01-09 22:37:35,141 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:37:35,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2025-01-09 22:37:35,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bc08f315/8eb52b7057794e9fb50298ba7a230010/FLAGe057cf257 [2025-01-09 22:37:35,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bc08f315/8eb52b7057794e9fb50298ba7a230010 [2025-01-09 22:37:35,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:37:35,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:37:35,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:37:35,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:37:35,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:37:35,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35, skipping insertion in model container [2025-01-09 22:37:35,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:37:35,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:37:35,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:37:35,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:37:35,755 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:37:35,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35 WrapperNode [2025-01-09 22:37:35,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:37:35,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:37:35,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:37:35,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:37:35,761 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:37:35" (1/1) ... [2025-01-09 22:37:35,773 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:37:35" (1/1) ... [2025-01-09 22:37:35,789 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2025-01-09 22:37:35,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:37:35,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:37:35,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:37:35,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:37:35,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,807 INFO L175 MemorySlicer]: Split 27 memory accesses to 2 slices as follows [2, 25]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-01-09 22:37:35,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:37:35,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:37:35,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:37:35,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:37:35,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (1/1) ... [2025-01-09 22:37:35,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:35,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:35,842 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:37:35,845 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:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:37:35,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:37:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:37:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:37:35,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:37:35,933 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:37:35,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:37:36,180 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 22:37:36,181 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:37:36,188 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:37:36,188 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 22:37:36,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:37:36 BoogieIcfgContainer [2025-01-09 22:37:36,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:37:36,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:37:36,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:37:36,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:37:36,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:37:35" (1/3) ... [2025-01-09 22:37:36,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2377ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:37:36, skipping insertion in model container [2025-01-09 22:37:36,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:35" (2/3) ... [2025-01-09 22:37:36,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2377ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:37:36, skipping insertion in model container [2025-01-09 22:37:36,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:37:36" (3/3) ... [2025-01-09 22:37:36,195 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2025-01-09 22:37:36,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:37:36,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-reverse_simple.i that has 2 procedures, 131 locations, 1 initial locations, 8 loop locations, and 55 error locations. [2025-01-09 22:37:36,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:37:36,241 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;@46df72cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:37:36,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-09 22:37:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 126 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:37:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:37:36,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:36,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:37:36,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2025-01-09 22:37:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-01-09 22:37:36,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:36,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:37:36,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:37:36,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:36,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:36,391 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:37:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-01-09 22:37:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842773125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:36,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117923050] [2025-01-09 22:37:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:36,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:36,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:36,414 INFO L87 Difference]: Start difference. First operand has 131 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 126 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:36,527 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2025-01-09 22:37:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:37:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:36,533 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:37:36,533 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 22:37:36,534 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:37:36,539 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:36,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 129 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 22:37:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 22:37:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2025-01-09 22:37:36,583 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 3 [2025-01-09 22:37:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:36,584 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2025-01-09 22:37:36,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2025-01-09 22:37:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:37:36,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:36,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:37:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:37:36,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:36,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2025-01-09 22:37:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-01-09 22:37:36,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:36,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:37:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:37:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:36,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:36,657 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:37:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-01-09 22:37:36,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:36,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299734340] [2025-01-09 22:37:36,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:36,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:36,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:36,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:36,659 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:36,744 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2025-01-09 22:37:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:36,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:37:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:36,745 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:37:36,745 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:37:36,745 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:37:36,746 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:36,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 125 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:37:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 22:37:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.9242424242424243) internal successors, (127), 118 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-01-09 22:37:36,751 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 3 [2025-01-09 22:37:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:36,751 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-01-09 22:37:36,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-01-09 22:37:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:37:36,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:36,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:37:36,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:36,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 919193298, now seen corresponding path program 1 times [2025-01-09 22:37:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941844883] [2025-01-09 22:37:36,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:37:36,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:37:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:36,918 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:37:36,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:36,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941844883] [2025-01-09 22:37:36,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941844883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:36,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:36,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:37:36,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578679955] [2025-01-09 22:37:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:36,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:36,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:36,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:37:36,921 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:37,105 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2025-01-09 22:37:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:37:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:37,107 INFO L225 Difference]: With dead ends: 150 [2025-01-09 22:37:37,107 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 22:37:37,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:37:37,107 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 124 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 136 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:37:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 22:37:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2025-01-09 22:37:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.858695652173913) internal successors, (171), 144 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2025-01-09 22:37:37,115 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 9 [2025-01-09 22:37:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:37,116 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2025-01-09 22:37:37,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2025-01-09 22:37:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:37:37,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:37,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:37:37,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 919193297, now seen corresponding path program 1 times [2025-01-09 22:37:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-01-09 22:37:37,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:37,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:37:37,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:37:37,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:37,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:37,181 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:37:37,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-01-09 22:37:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832498494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:37,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:37,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:37:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586046916] [2025-01-09 22:37:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:37,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:37,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:37:37,183 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:37,323 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2025-01-09 22:37:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:37:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:37,324 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:37:37,324 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:37:37,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:37:37,325 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 94 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:37,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:37:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 22:37:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 131 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2025-01-09 22:37:37,329 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 9 [2025-01-09 22:37:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:37,329 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2025-01-09 22:37:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2025-01-09 22:37:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:37:37,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:37,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:37:37,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:37,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1678154925, now seen corresponding path program 1 times [2025-01-09 22:37:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:37,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032838806] [2025-01-09 22:37:37,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:37:37,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:37:37,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:37,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:37,436 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:37:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032838806] [2025-01-09 22:37:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032838806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016702138] [2025-01-09 22:37:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:37,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:37,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:37,437 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:37,622 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2025-01-09 22:37:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:37:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:37:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:37,623 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:37:37,623 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:37:37,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:37:37,624 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:37,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:37:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:37:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 22:37:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.5806451612903225) internal successors, (147), 130 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2025-01-09 22:37:37,629 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 13 [2025-01-09 22:37:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:37,629 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2025-01-09 22:37:37,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2025-01-09 22:37:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:37:37,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:37,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:37:37,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1678154924, now seen corresponding path program 1 times [2025-01-09 22:37:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-01-09 22:37:37,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:37:37,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:37:37,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:37,803 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:37:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-01-09 22:37:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085792694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146613893] [2025-01-09 22:37:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:37,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:37,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:37,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:37,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:37,804 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:37,977 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2025-01-09 22:37:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:37:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:37:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:37,978 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:37:37,978 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:37:37,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:37:37,978 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:37,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:37:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2025-01-09 22:37:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 120 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2025-01-09 22:37:37,983 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 13 [2025-01-09 22:37:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:37,983 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2025-01-09 22:37:37,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2025-01-09 22:37:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:37:37,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:37,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:37:37,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:37,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1026792985, now seen corresponding path program 1 times [2025-01-09 22:37:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-01-09 22:37:37,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:37,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:37:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:37:37,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:38,014 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:37:38,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-01-09 22:37:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:38,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:37:38,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372854327] [2025-01-09 22:37:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:38,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:38,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:38,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:37:38,016 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:38,093 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2025-01-09 22:37:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:37:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:38,094 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:37:38,094 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:37:38,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:37:38,095 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 95 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:38,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 180 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:37:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2025-01-09 22:37:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.528735632183908) internal successors, (133), 120 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2025-01-09 22:37:38,098 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 16 [2025-01-09 22:37:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:38,098 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2025-01-09 22:37:38,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2025-01-09 22:37:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:37:38,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:38,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:37:38,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1683580388, now seen corresponding path program 1 times [2025-01-09 22:37:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-01-09 22:37:38,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:38,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:37:38,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:37:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-01-09 22:37:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831501061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:37:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117787064] [2025-01-09 22:37:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:38,227 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:38,355 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2025-01-09 22:37:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:37:38,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:37:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:38,356 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:37:38,356 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:37:38,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:37:38,357 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 27 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:38,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 394 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:37:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2025-01-09 22:37:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 128 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2025-01-09 22:37:38,363 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 17 [2025-01-09 22:37:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:38,363 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2025-01-09 22:37:38,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2025-01-09 22:37:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:37:38,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:38,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:37:38,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 958282396, now seen corresponding path program 1 times [2025-01-09 22:37:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433217182] [2025-01-09 22:37:38,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:37:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:37:38,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:38,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:38,463 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:37:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433217182] [2025-01-09 22:37:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433217182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:38,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:37:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7802703] [2025-01-09 22:37:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:38,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:38,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:38,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:38,465 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:38,585 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2025-01-09 22:37:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:37:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:37:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:38,586 INFO L225 Difference]: With dead ends: 145 [2025-01-09 22:37:38,586 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 22:37:38,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:37:38,587 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 14 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:38,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 289 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 22:37:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2025-01-09 22:37:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 138 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2025-01-09 22:37:38,590 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 19 [2025-01-09 22:37:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2025-01-09 22:37:38,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2025-01-09 22:37:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:37:38,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:38,590 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] [2025-01-09 22:37:38,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:37:38,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:38,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -929982252, now seen corresponding path program 1 times [2025-01-09 22:37:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:38,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209315122] [2025-01-09 22:37:38,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:37:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:37:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:38,694 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:37:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209315122] [2025-01-09 22:37:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209315122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:38,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109224028] [2025-01-09 22:37:38,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:38,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:38,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:38,696 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:38,852 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2025-01-09 22:37:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:37:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:37:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:38,853 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:37:38,853 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:37:38,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:37:38,853 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:38,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 225 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:37:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-01-09 22:37:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 137 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-01-09 22:37:38,857 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 22 [2025-01-09 22:37:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:38,857 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-01-09 22:37:38,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-01-09 22:37:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:37:38,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:38,858 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] [2025-01-09 22:37:38,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:37:38,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -929982251, now seen corresponding path program 1 times [2025-01-09 22:37:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790719300] [2025-01-09 22:37:38,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:38,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:37:38,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:37:38,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:38,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:38,994 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:37:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790719300] [2025-01-09 22:37:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790719300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:38,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:38,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863614365] [2025-01-09 22:37:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:38,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:38,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:38,996 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:39,132 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2025-01-09 22:37:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:37:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:37:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:39,133 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:37:39,133 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:37:39,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:39,133 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:39,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:37:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 22:37:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 135 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2025-01-09 22:37:39,136 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 22 [2025-01-09 22:37:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:39,137 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2025-01-09 22:37:39,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2025-01-09 22:37:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:37:39,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:39,137 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] [2025-01-09 22:37:39,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:37:39,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1833825969, now seen corresponding path program 1 times [2025-01-09 22:37:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417673609] [2025-01-09 22:37:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:39,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:37:39,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:37:39,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:39,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417673609] [2025-01-09 22:37:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417673609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445899137] [2025-01-09 22:37:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:39,405 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:37:39,406 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:37:39,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:37:39,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:37:39,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:39,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:39,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:37:39,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:39,514 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:37:39,609 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:37:39,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:37:39,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:39,772 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:39,772 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 33 treesize of output 24 [2025-01-09 22:37:39,796 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:39,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:37:39,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:39,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:40,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:40,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:37:40,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:40,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 22:37:40,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:37:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445899137] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:40,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-01-09 22:37:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396422958] [2025-01-09 22:37:40,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:37:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:37:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=787, Unknown=7, NotChecked=0, Total=930 [2025-01-09 22:37:40,836 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:41,641 INFO L93 Difference]: Finished difference Result 228 states and 265 transitions. [2025-01-09 22:37:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:37:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 22:37:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:41,643 INFO L225 Difference]: With dead ends: 228 [2025-01-09 22:37:41,643 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 22:37:41,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1058, Unknown=7, NotChecked=0, Total=1260 [2025-01-09 22:37:41,644 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 496 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:41,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 664 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:37:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 22:37:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2025-01-09 22:37:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 154 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2025-01-09 22:37:41,647 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 26 [2025-01-09 22:37:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2025-01-09 22:37:41,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2025-01-09 22:37:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:37:41,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:41,648 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] [2025-01-09 22:37:41,654 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:37:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:37:41,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1833825968, now seen corresponding path program 1 times [2025-01-09 22:37:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523627420] [2025-01-09 22:37:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:41,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:37:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:37:41,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:41,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:42,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523627420] [2025-01-09 22:37:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523627420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331163078] [2025-01-09 22:37:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:42,103 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:37:42,105 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:37:42,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:37:42,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:37:42,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:42,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:42,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:37:42,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:42,182 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:37:42,239 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:37:42,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:42,246 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:37:42,279 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:37:42,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:42,395 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:37:42,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:37:42,412 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:42,412 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 33 treesize of output 24 [2025-01-09 22:37:42,444 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:42,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:37:42,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:37:42,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:42,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:37:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:42,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:42,905 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))) (forall ((v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 1))))) is different from false [2025-01-09 22:37:42,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 1)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))))) is different from false [2025-01-09 22:37:42,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:37:42,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:42,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 22:37:42,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:37:42,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:42,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-01-09 22:37:42,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:42,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-09 22:37:42,998 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:43,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:43,002 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 27 treesize of output 19 [2025-01-09 22:37:43,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:43,008 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 12 [2025-01-09 22:37:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331163078] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:43,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2025-01-09 22:37:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243487637] [2025-01-09 22:37:43,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:43,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:37:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:43,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:37:43,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=7, NotChecked=122, Total=1122 [2025-01-09 22:37:43,211 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:44,359 INFO L93 Difference]: Finished difference Result 230 states and 267 transitions. [2025-01-09 22:37:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:37:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 22:37:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:44,361 INFO L225 Difference]: With dead ends: 230 [2025-01-09 22:37:44,361 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 22:37:44,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=330, Invalid=1927, Unknown=7, NotChecked=186, Total=2450 [2025-01-09 22:37:44,363 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 510 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:44,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 846 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1325 Invalid, 0 Unknown, 409 Unchecked, 0.7s Time] [2025-01-09 22:37:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 22:37:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2025-01-09 22:37:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 154 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2025-01-09 22:37:44,368 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2025-01-09 22:37:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:44,368 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2025-01-09 22:37:44,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2025-01-09 22:37:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:37:44,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:44,369 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] [2025-01-09 22:37:44,375 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:37:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:44,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 189976901, now seen corresponding path program 1 times [2025-01-09 22:37:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:44,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 22:37:44,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:44,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:37:44,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:37:44,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 22:37:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217468550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137216524] [2025-01-09 22:37:44,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:44,817 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:37:44,819 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:37:44,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:37:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:37:44,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:44,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:37:44,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:44,898 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:37:44,952 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:37:44,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:37:44,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:45,057 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:45,058 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 33 treesize of output 24 [2025-01-09 22:37:45,075 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:45,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:37:45,170 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:37:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:45,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:45,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:37:45,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:45,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 22:37:45,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:37:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137216524] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:45,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-01-09 22:37:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275307205] [2025-01-09 22:37:45,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:37:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:45,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:37:45,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=685, Unknown=8, NotChecked=0, Total=812 [2025-01-09 22:37:45,776 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:46,295 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2025-01-09 22:37:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:37:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:37:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:46,297 INFO L225 Difference]: With dead ends: 211 [2025-01-09 22:37:46,297 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 22:37:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=733, Unknown=8, NotChecked=0, Total=870 [2025-01-09 22:37:46,297 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 261 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:46,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 721 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:37:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 22:37:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 163. [2025-01-09 22:37:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 161 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2025-01-09 22:37:46,300 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 28 [2025-01-09 22:37:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:46,301 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2025-01-09 22:37:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2025-01-09 22:37:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:37:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:46,301 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] [2025-01-09 22:37:46,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:37:46,506 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:37:46,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:46,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 189976902, now seen corresponding path program 1 times [2025-01-09 22:37:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428982685] [2025-01-09 22:37:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:46,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:37:46,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:37:46,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:46,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428982685] [2025-01-09 22:37:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428982685] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882556843] [2025-01-09 22:37:46,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:46,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:46,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:46,787 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:37:46,788 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:37:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:37:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:37:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:46,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:37:46,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:46,864 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:37:46,907 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:37:46,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:46,919 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:37:46,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:37:46,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:47,036 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:47,036 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 33 treesize of output 24 [2025-01-09 22:37:47,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:47,044 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:37:47,057 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:47,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:37:47,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:37:47,166 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:37:47,172 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:37:47,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:47,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:37:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:47,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:47,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_506 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_507 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_507) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_506) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_507 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_507) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0))))) is different from false [2025-01-09 22:37:47,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:47,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:37:47,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 22:37:47,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:37:47,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:47,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-01-09 22:37:47,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:47,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-09 22:37:47,587 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:47,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:47,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:47,590 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 27 treesize of output 19 [2025-01-09 22:37:47,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:47,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:47,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:47,597 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 12 [2025-01-09 22:37:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882556843] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:47,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2025-01-09 22:37:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321989134] [2025-01-09 22:37:47,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:37:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:47,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:37:47,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=770, Unknown=6, NotChecked=56, Total=930 [2025-01-09 22:37:47,751 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:48,546 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2025-01-09 22:37:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:37:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:37:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:48,547 INFO L225 Difference]: With dead ends: 215 [2025-01-09 22:37:48,547 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 22:37:48,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1150, Unknown=6, NotChecked=70, Total=1406 [2025-01-09 22:37:48,548 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 278 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:48,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 843 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1347 Invalid, 0 Unknown, 167 Unchecked, 0.6s Time] [2025-01-09 22:37:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 22:37:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2025-01-09 22:37:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 161 states have internal predecessors, (188), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2025-01-09 22:37:48,551 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 28 [2025-01-09 22:37:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2025-01-09 22:37:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2025-01-09 22:37:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:37:48,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:48,552 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] [2025-01-09 22:37:48,559 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:37:48,753 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:37:48,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:37:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1137290723, now seen corresponding path program 1 times [2025-01-09 22:37:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94942434] [2025-01-09 22:37:48,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:48,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:37:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:37:48,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:48,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94942434] [2025-01-09 22:37:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94942434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562739137] [2025-01-09 22:37:48,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:48,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:48,957 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:37:48,959 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:37:49,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:37:49,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:37:49,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:49,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:49,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:37:49,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:49,145 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:37:49,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:37:49,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:49,295 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:49,296 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 33 treesize of output 24 [2025-01-09 22:37:49,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:49,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:37:49,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:49,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:49,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:49,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:37:49,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 22:37:49,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:37:51,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:51,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 225 treesize of output 1413