./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a6262d763f7ed171dce710cdc24b572d94af62f6bd3905688cd60ad1ece18b4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:13:17,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:13:17,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:13:17,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:13:17,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:13:17,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:13:17,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:13:17,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:13:17,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:13:17,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:13:17,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:13:17,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:13:17,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:13:17,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:13:17,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:17,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:17,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:17,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:13:17,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:13:17,821 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/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 -> 3a6262d763f7ed171dce710cdc24b572d94af62f6bd3905688cd60ad1ece18b4 [2025-04-29 11:13:18,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:13:18,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:13:18,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:13:18,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:13:18,051 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:13:18,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca-2.c [2025-04-29 11:13:19,382 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4052fa025/584250052e064290819867c56237a8fb/FLAG1bc97136a [2025-04-29 11:13:19,570 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:13:19,572 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrcmp-alloca-2.c [2025-04-29 11:13:19,573 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:13:19,592 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4052fa025/584250052e064290819867c56237a8fb/FLAG1bc97136a [2025-04-29 11:13:20,433 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4052fa025/584250052e064290819867c56237a8fb [2025-04-29 11:13:20,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:13:20,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:13:20,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:20,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:13:20,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:13:20,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7909d342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20, skipping insertion in model container [2025-04-29 11:13:20,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:13:20,602 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:20,603 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:20,608 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:20,615 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:13:20,636 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:20,645 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:13:20,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20 WrapperNode [2025-04-29 11:13:20,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:20,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:20,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:13:20,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:13:20,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,667 INFO L138 Inliner]: procedures = 10, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-04-29 11:13:20,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:20,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:13:20,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:13:20,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:13:20,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,685 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-29 11:13:20,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:13:20,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:13:20,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:13:20,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:13:20,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (1/1) ... [2025-04-29 11:13:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:20,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:20,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:13:20,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:13:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:13:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:13:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:13:20,786 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:13:20,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:13:20,962 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-04-29 11:13:20,963 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:13:20,971 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:13:20,973 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:13:20,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:20 BoogieIcfgContainer [2025-04-29 11:13:20,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:13:20,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:13:20,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:13:20,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:13:20,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:13:20" (1/3) ... [2025-04-29 11:13:20,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794c93b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:20, skipping insertion in model container [2025-04-29 11:13:20,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:20" (2/3) ... [2025-04-29 11:13:20,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794c93b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:20, skipping insertion in model container [2025-04-29 11:13:20,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:20" (3/3) ... [2025-04-29 11:13:20,982 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.c [2025-04-29 11:13:20,993 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:13:20,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcmp-alloca-2.c that has 1 procedures, 49 locations, 55 edges, 1 initial locations, 3 loop locations, and 19 error locations. [2025-04-29 11:13:21,028 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:13:21,036 INFO L340 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;@598895ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:13:21,037 INFO L341 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-04-29 11:13:21,041 INFO L278 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.896551724137931) internal successors, (55), 48 states have internal predecessors, (55), 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-04-29 11:13:21,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:21,044 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:21,045 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:21,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-29 11:13:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549033376] [2025-04-29 11:13:21,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:21,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:21,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:21,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549033376] [2025-04-29 11:13:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549033376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289293330] [2025-04-29 11:13:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:21,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,259 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.896551724137931) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,293 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-04-29 11:13:21,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:21,295 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:21,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,300 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:21,300 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:13:21,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,305 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:13:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-04-29 11:13:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 49 states have internal predecessors, (56), 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-04-29 11:13:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-04-29 11:13:21,329 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 7 [2025-04-29 11:13:21,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,330 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-29 11:13:21,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,330 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-04-29 11:13:21,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:21,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:21,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:13:21,331 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:21,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876010, now seen corresponding path program 1 times [2025-04-29 11:13:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514547903] [2025-04-29 11:13:21,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:21,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:21,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,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-04-29 11:13:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514547903] [2025-04-29 11:13:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514547903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128152419] [2025-04-29 11:13:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:21,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:21,438 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,478 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-04-29 11:13:21,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:21,479 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:21,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,479 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:13:21,479 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:13:21,480 INFO L436 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-04-29 11:13:21,480 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,480 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:13:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:13:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 47 states have internal predecessors, (54), 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-04-29 11:13:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-04-29 11:13:21,486 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 7 [2025-04-29 11:13:21,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,486 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-04-29 11:13:21,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,486 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-04-29 11:13:21,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:21,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:21,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:13:21,487 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:21,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-29 11:13:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940569718] [2025-04-29 11:13:21,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:21,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:21,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940569718] [2025-04-29 11:13:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940569718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41606791] [2025-04-29 11:13:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:21,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:21,702 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,778 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-04-29 11:13:21,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:21,778 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:21,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,781 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:13:21,781 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:13:21,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:21,782 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,782 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 102 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:13:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-04-29 11:13:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 49 states have internal predecessors, (57), 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-04-29 11:13:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-04-29 11:13:21,786 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 7 [2025-04-29 11:13:21,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,787 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-04-29 11:13:21,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:21,787 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-04-29 11:13:21,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:21,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:21,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:13:21,787 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:21,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash 121329398, now seen corresponding path program 1 times [2025-04-29 11:13:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051992863] [2025-04-29 11:13:21,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:21,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051992863] [2025-04-29 11:13:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051992863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511149897] [2025-04-29 11:13:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:21,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,922 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:13:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,940 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-04-29 11:13:21,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:21,941 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:21,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,941 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:13:21,941 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:13:21,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,942 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:13:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-29 11:13:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 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-04-29 11:13:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-04-29 11:13:21,945 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 8 [2025-04-29 11:13:21,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,945 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-04-29 11:13:21,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:13:21,945 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-04-29 11:13:21,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:21,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:21,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:13:21,946 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:21,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash 121329206, now seen corresponding path program 1 times [2025-04-29 11:13:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461865951] [2025-04-29 11:13:21,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:21,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461865951] [2025-04-29 11:13:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461865951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:21,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502344116] [2025-04-29 11:13:21,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:21,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,979 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:13:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,994 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-04-29 11:13:21,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:21,994 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:21,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,995 INFO L225 Difference]: With dead ends: 70 [2025-04-29 11:13:21,995 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 11:13:21,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:21,995 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 95 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 11:13:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-04-29 11:13:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 63 states have internal predecessors, (77), 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-04-29 11:13:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-04-29 11:13:22,001 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 8 [2025-04-29 11:13:22,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,001 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-04-29 11:13:22,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:13:22,002 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2025-04-29 11:13:22,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:13:22,002 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 123176248, now seen corresponding path program 1 times [2025-04-29 11:13:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848168143] [2025-04-29 11:13:22,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:22,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848168143] [2025-04-29 11:13:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848168143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980723286] [2025-04-29 11:13:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:22,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:22,138 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04-29 11:13:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,209 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-04-29 11:13:22,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:22,209 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:22,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,210 INFO L225 Difference]: With dead ends: 70 [2025-04-29 11:13:22,210 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 11:13:22,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:22,210 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 11:13:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-04-29 11:13:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-04-29 11:13:22,214 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 8 [2025-04-29 11:13:22,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,214 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-04-29 11:13:22,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04-29 11:13:22,214 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-04-29 11:13:22,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:22,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:13:22,215 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 123176247, now seen corresponding path program 1 times [2025-04-29 11:13:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218342982] [2025-04-29 11:13:22,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218342982] [2025-04-29 11:13:22,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218342982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681661380] [2025-04-29 11:13:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:22,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:22,242 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-29 11:13:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,265 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-04-29 11:13:22,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:22,265 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:22,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,266 INFO L225 Difference]: With dead ends: 66 [2025-04-29 11:13:22,266 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:13:22,266 INFO L436 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-04-29 11:13:22,266 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:13:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-29 11:13:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 65 states have internal predecessors, (80), 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-04-29 11:13:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-04-29 11:13:22,270 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 8 [2025-04-29 11:13:22,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,270 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-04-29 11:13:22,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-29 11:13:22,270 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-04-29 11:13:22,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:22,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:13:22,270 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash 178587700, now seen corresponding path program 1 times [2025-04-29 11:13:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934957536] [2025-04-29 11:13:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:22,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:22,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934957536] [2025-04-29 11:13:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934957536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693637859] [2025-04-29 11:13:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:22,371 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-04-29 11:13:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,402 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-04-29 11:13:22,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:22,402 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:22,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,403 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:13:22,403 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:13:22,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:22,404 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:13:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-04-29 11:13:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 57 states have internal predecessors, (69), 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-04-29 11:13:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-04-29 11:13:22,411 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 8 [2025-04-29 11:13:22,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,412 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-04-29 11:13:22,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-04-29 11:13:22,412 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-04-29 11:13:22,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:13:22,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:13:22,412 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -533755979, now seen corresponding path program 1 times [2025-04-29 11:13:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804307566] [2025-04-29 11:13:22,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:13:22,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:13:22,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804307566] [2025-04-29 11:13:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804307566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179015065] [2025-04-29 11:13:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:22,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:22,493 INFO L87 Difference]: Start difference. First operand 58 states and 69 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-04-29 11:13:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,512 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-04-29 11:13:22,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:22,513 INFO L79 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-04-29 11:13:22,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,513 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:13:22,513 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:13:22,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:22,514 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:13:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-04-29 11:13:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 59 states have internal predecessors, (71), 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-04-29 11:13:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-04-29 11:13:22,516 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 9 [2025-04-29 11:13:22,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,516 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-04-29 11:13:22,516 INFO L486 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-04-29 11:13:22,516 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-04-29 11:13:22,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:13:22,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:13:22,521 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -476497677, now seen corresponding path program 1 times [2025-04-29 11:13:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307884373] [2025-04-29 11:13:22,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:13:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:13:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307884373] [2025-04-29 11:13:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307884373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278475370] [2025-04-29 11:13:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:22,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:22,603 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-04-29 11:13:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,632 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-29 11:13:22,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:22,633 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-04-29 11:13:22,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,633 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:22,633 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:22,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:22,634 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-04-29 11:13:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 56 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-04-29 11:13:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-04-29 11:13:22,636 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 9 [2025-04-29 11:13:22,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,636 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-04-29 11:13:22,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-04-29 11:13:22,637 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-04-29 11:13:22,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:13:22,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,637 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:13:22,637 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:22,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-29 11:13:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580824525] [2025-04-29 11:13:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:22,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:22,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580824525] [2025-04-29 11:13:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580824525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:22,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114372304] [2025-04-29 11:13:22,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:22,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:22,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:22,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:13:22,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:22,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:22,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:13:22,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:22,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:22,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-04-29 11:13:22,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:23,189 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:13:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114372304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:23,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:23,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-29 11:13:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900480375] [2025-04-29 11:13:23,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:13:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:13:23,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:13:23,227 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-04-29 11:13:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,384 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-04-29 11:13:23,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:23,384 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 10 [2025-04-29 11:13:23,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,384 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:13:23,384 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:13:23,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:23,385 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:13:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-04-29 11:13:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.5) internal successors, (60), 51 states have internal predecessors, (60), 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-04-29 11:13:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-04-29 11:13:23,387 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 10 [2025-04-29 11:13:23,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,387 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-04-29 11:13:23,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-04-29 11:13:23,387 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-04-29 11:13:23,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:23,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:13:23,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:13:23,589 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:23,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1838388167, now seen corresponding path program 1 times [2025-04-29 11:13:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858647308] [2025-04-29 11:13:23,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:23,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:23,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858647308] [2025-04-29 11:13:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858647308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537888474] [2025-04-29 11:13:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:23,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:23,669 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,738 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2025-04-29 11:13:23,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:23,738 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:13:23,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,739 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:13:23,739 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:13:23,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:23,739 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 114 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:13:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2025-04-29 11:13:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.5625) internal successors, (75), 59 states have internal predecessors, (75), 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-04-29 11:13:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-04-29 11:13:23,742 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 11 [2025-04-29 11:13:23,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,742 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-04-29 11:13:23,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:23,742 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-04-29 11:13:23,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:23,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:13:23,745 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:23,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1838388168, now seen corresponding path program 1 times [2025-04-29 11:13:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220291485] [2025-04-29 11:13:23,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:23,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:23,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220291485] [2025-04-29 11:13:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220291485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994561777] [2025-04-29 11:13:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:23,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:23,783 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,814 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-04-29 11:13:23,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:23,814 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:13:23,814 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,815 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:13:23,815 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:13:23,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:23,815 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:13:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-29 11:13:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.4375) internal successors, (69), 56 states have internal predecessors, (69), 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-04-29 11:13:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-04-29 11:13:23,817 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 11 [2025-04-29 11:13:23,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,817 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-04-29 11:13:23,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:23,817 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-04-29 11:13:23,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:23,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,818 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:13:23,818 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:23,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1641506446, now seen corresponding path program 1 times [2025-04-29 11:13:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992467429] [2025-04-29 11:13:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992467429] [2025-04-29 11:13:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992467429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:23,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768735535] [2025-04-29 11:13:23,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:23,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:23,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:13:23,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:13:24,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:24,017 INFO L354 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 7 [2025-04-29 11:13:24,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:13:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768735535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:24,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:24,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-29 11:13:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882886632] [2025-04-29 11:13:24,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:13:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:13:24,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:24,279 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 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-04-29 11:13:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:24,411 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-04-29 11:13:24,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:24,412 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:13:24,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:24,412 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:13:24,412 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:13:24,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:24,413 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:24,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:13:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-04-29 11:13:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 53 states have internal predecessors, (65), 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-04-29 11:13:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-04-29 11:13:24,414 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-04-29 11:13:24,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:24,414 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-04-29 11:13:24,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 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-04-29 11:13:24,414 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-04-29 11:13:24,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:13:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:24,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:24,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:13:24,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:13:24,615 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:24,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1903462590, now seen corresponding path program 1 times [2025-04-29 11:13:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:24,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623028643] [2025-04-29 11:13:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:24,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:24,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:24,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623028643] [2025-04-29 11:13:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623028643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701828797] [2025-04-29 11:13:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:24,653 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:24,678 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-04-29 11:13:24,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:24,679 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:13:24,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:24,680 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:13:24,680 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:13:24,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:24,681 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:24,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:13:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:13:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 51 states have internal predecessors, (62), 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-04-29 11:13:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-04-29 11:13:24,683 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2025-04-29 11:13:24,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:24,683 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-04-29 11:13:24,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:24,683 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-04-29 11:13:24,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:13:24,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:24,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:24,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:13:24,684 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:24,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1903462591, now seen corresponding path program 1 times [2025-04-29 11:13:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:24,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670834103] [2025-04-29 11:13:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:24,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:24,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:24,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:24,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:24,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670834103] [2025-04-29 11:13:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670834103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:24,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:24,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:24,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077821305] [2025-04-29 11:13:24,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:24,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:24,753 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:24,805 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-04-29 11:13:24,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:24,805 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:13:24,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:24,806 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:24,806 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:24,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:24,806 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:24,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2025-04-29 11:13:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3125) internal successors, (63), 53 states have internal predecessors, (63), 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-04-29 11:13:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-04-29 11:13:24,808 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 15 [2025-04-29 11:13:24,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:24,808 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-04-29 11:13:24,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:24,809 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-04-29 11:13:24,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:24,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:24,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:24,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:13:24,809 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:24,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1121921783, now seen corresponding path program 1 times [2025-04-29 11:13:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:24,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272493650] [2025-04-29 11:13:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:24,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:24,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:24,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:24,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272493650] [2025-04-29 11:13:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272493650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855085953] [2025-04-29 11:13:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:24,830 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-29 11:13:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:24,837 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-29 11:13:24,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:24,837 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-04-29 11:13:24,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:24,838 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:13:24,838 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:13:24,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:24,838 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:24,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:13:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:13:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.3) internal successors, (65), 55 states have internal predecessors, (65), 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-04-29 11:13:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-04-29 11:13:24,840 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 16 [2025-04-29 11:13:24,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:24,840 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-04-29 11:13:24,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-29 11:13:24,840 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-04-29 11:13:24,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:13:24,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:24,841 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-04-29 11:13:24,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:13:24,841 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:24,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash 510898350, now seen corresponding path program 1 times [2025-04-29 11:13:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:24,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773578416] [2025-04-29 11:13:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:24,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:13:24,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:24,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:24,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:24,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773578416] [2025-04-29 11:13:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773578416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:13:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555805841] [2025-04-29 11:13:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:13:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:13:24,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:24,997 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-04-29 11:13:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:25,054 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2025-04-29 11:13:25,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:25,054 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-04-29 11:13:25,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:25,055 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:13:25,055 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:13:25,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:13:25,055 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:25,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:13:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-04-29 11:13:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 65 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-04-29 11:13:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-04-29 11:13:25,058 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 19 [2025-04-29 11:13:25,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:25,058 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-04-29 11:13:25,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-04-29 11:13:25,058 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2025-04-29 11:13:25,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:13:25,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:25,059 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-04-29 11:13:25,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:13:25,059 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:25,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1077449552, now seen corresponding path program 1 times [2025-04-29 11:13:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:25,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831107485] [2025-04-29 11:13:25,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:25,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:13:25,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:25,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:25,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:25,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831107485] [2025-04-29 11:13:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831107485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:13:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095888115] [2025-04-29 11:13:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:25,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:13:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:25,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:13:25,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:25,191 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-04-29 11:13:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:25,257 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-04-29 11:13:25,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:25,257 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-04-29 11:13:25,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:25,258 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:13:25,258 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:13:25,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:25,258 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:25,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 153 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:13:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2025-04-29 11:13:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 67 states have internal predecessors, (80), 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-04-29 11:13:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-04-29 11:13:25,260 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 19 [2025-04-29 11:13:25,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:25,261 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-04-29 11:13:25,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-04-29 11:13:25,261 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-04-29 11:13:25,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:13:25,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:25,261 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] [2025-04-29 11:13:25,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:13:25,261 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:25,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1501285064, now seen corresponding path program 1 times [2025-04-29 11:13:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:25,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998037253] [2025-04-29 11:13:25,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:25,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:13:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:13:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:25,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:25,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998037253] [2025-04-29 11:13:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998037253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808769803] [2025-04-29 11:13:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:25,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:25,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:25,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:25,364 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:25,385 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2025-04-29 11:13:25,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:25,386 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:13:25,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:25,387 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:13:25,387 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:13:25,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:25,388 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:25,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:13:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-29 11:13:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-29 11:13:25,392 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 20 [2025-04-29 11:13:25,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:25,392 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-29 11:13:25,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:25,392 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-29 11:13:25,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:25,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:25,392 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-04-29 11:13:25,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:13:25,393 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:25,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash -408736522, now seen corresponding path program 1 times [2025-04-29 11:13:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:25,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27795748] [2025-04-29 11:13:25,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:25,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:25,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:25,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:25,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27795748] [2025-04-29 11:13:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27795748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:25,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238741853] [2025-04-29 11:13:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:25,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:25,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:25,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:13:25,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:25,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:25,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:25,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:25,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:13:25,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:25,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:25,742 INFO L354 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 5 treesize of output 3 [2025-04-29 11:13:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238741853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:25,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-29 11:13:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384995533] [2025-04-29 11:13:25,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:25,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:13:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:25,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:13:25,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:13:25,764 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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-04-29 11:13:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:25,870 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-04-29 11:13:25,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:25,870 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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-04-29 11:13:25,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:25,871 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:25,871 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:25,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:13:25,872 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:25,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 181 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2025-04-29 11:13:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-29 11:13:25,874 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 22 [2025-04-29 11:13:25,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:25,874 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-29 11:13:25,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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-04-29 11:13:25,875 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-29 11:13:25,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:13:25,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:25,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:25,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:26,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,076 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:26,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -676158724, now seen corresponding path program 1 times [2025-04-29 11:13:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:26,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794788970] [2025-04-29 11:13:26,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:13:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:13:26,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:26,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:26,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794788970] [2025-04-29 11:13:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794788970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:26,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195592272] [2025-04-29 11:13:26,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:26,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:26,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:13:26,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:13:26,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:13:26,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:26,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:13:26,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:26,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:26,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:26,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:26,483 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195592272] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:26,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-29 11:13:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166567479] [2025-04-29 11:13:26,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:26,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:13:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:26,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:13:26,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:26,530 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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-04-29 11:13:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:26,681 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2025-04-29 11:13:26,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:13:26,683 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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-04-29 11:13:26,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:26,684 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:13:26,684 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:13:26,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:13:26,685 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:26,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 257 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:13:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-29 11:13:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 68 states have internal predecessors, (77), 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-04-29 11:13:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2025-04-29 11:13:26,688 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 26 [2025-04-29 11:13:26,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:26,688 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2025-04-29 11:13:26,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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-04-29 11:13:26,688 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2025-04-29 11:13:26,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:13:26,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:26,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:26,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:13:26,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,893 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:26,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1239726455, now seen corresponding path program 1 times [2025-04-29 11:13:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:26,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961510015] [2025-04-29 11:13:26,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:26,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:13:26,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:13:26,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:26,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:27,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961510015] [2025-04-29 11:13:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961510015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:27,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:13:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411572776] [2025-04-29 11:13:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:27,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:13:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:27,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:13:27,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:27,068 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-04-29 11:13:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:27,170 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2025-04-29 11:13:27,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:13:27,170 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-04-29 11:13:27,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:27,171 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:13:27,171 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:27,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:13:27,171 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:27,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 166 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-29 11:13:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 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-04-29 11:13:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-04-29 11:13:27,173 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 28 [2025-04-29 11:13:27,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:27,173 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-04-29 11:13:27,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-04-29 11:13:27,173 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-04-29 11:13:27,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:13:27,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:27,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:27,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:13:27,174 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:27,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1099177845, now seen corresponding path program 1 times [2025-04-29 11:13:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:27,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296438913] [2025-04-29 11:13:27,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:27,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:13:27,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:13:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:27,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296438913] [2025-04-29 11:13:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296438913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:13:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945698908] [2025-04-29 11:13:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:27,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:13:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:27,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:13:27,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:27,366 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-04-29 11:13:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:27,492 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-04-29 11:13:27,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:13:27,492 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-04-29 11:13:27,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:27,493 INFO L225 Difference]: With dead ends: 85 [2025-04-29 11:13:27,493 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:13:27,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:13:27,493 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:27,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 167 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:13:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2025-04-29 11:13:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 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-04-29 11:13:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2025-04-29 11:13:27,495 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 28 [2025-04-29 11:13:27,495 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:27,495 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2025-04-29 11:13:27,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-04-29 11:13:27,495 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2025-04-29 11:13:27,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:13:27,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:27,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:27,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:13:27,495 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:27,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 71898205, now seen corresponding path program 1 times [2025-04-29 11:13:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:27,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138756253] [2025-04-29 11:13:27,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:27,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:13:27,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:13:27,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:27,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:27,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138756253] [2025-04-29 11:13:27,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138756253] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:27,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579232652] [2025-04-29 11:13:27,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:27,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:27,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:13:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:13:27,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:13:27,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:13:27,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:27,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-04-29 11:13:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:27,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579232652] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:27,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-29 11:13:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988132975] [2025-04-29 11:13:27,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:27,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:27,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:27,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:27,959 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 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-04-29 11:13:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:28,050 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-04-29 11:13:28,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:28,050 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:13:28,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:28,050 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:13:28,051 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:13:28,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:28,051 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:28,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 160 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:13:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-04-29 11:13:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 46 states have internal predecessors, (49), 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-04-29 11:13:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-04-29 11:13:28,053 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 31 [2025-04-29 11:13:28,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:28,053 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-04-29 11:13:28,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 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-04-29 11:13:28,053 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-04-29 11:13:28,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:13:28,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:28,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:28,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:13:28,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:13:28,259 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:28,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash 167967689, now seen corresponding path program 1 times [2025-04-29 11:13:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:28,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484303371] [2025-04-29 11:13:28,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:28,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:13:28,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:13:28,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:28,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:28,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484303371] [2025-04-29 11:13:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484303371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:28,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916595410] [2025-04-29 11:13:28,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:28,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:28,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:13:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:13:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:13:28,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:28,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:28,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:13:28,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:28,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:28,708 INFO L354 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 5 treesize of output 3 [2025-04-29 11:13:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:28,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916595410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:28,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:28,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-04-29 11:13:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377913083] [2025-04-29 11:13:28,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:28,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:28,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:28,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:28,742 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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-04-29 11:13:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:28,873 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-04-29 11:13:28,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:28,874 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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 36 [2025-04-29 11:13:28,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:28,874 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:13:28,874 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:13:28,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:28,875 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:28,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 234 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:13:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2025-04-29 11:13:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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-04-29 11:13:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-04-29 11:13:28,877 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 36 [2025-04-29 11:13:28,877 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:28,877 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-04-29 11:13:28,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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-04-29 11:13:28,877 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-04-29 11:13:28,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:13:28,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:28,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:28,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:29,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:13:29,078 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:29,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 353947727, now seen corresponding path program 1 times [2025-04-29 11:13:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:29,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481245224] [2025-04-29 11:13:29,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:29,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:13:29,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:13:29,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:29,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481245224] [2025-04-29 11:13:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481245224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:29,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470412922] [2025-04-29 11:13:29,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:29,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:29,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:13:29,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:13:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:13:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:29,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:13:29,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:29,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:30,005 INFO L354 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 16 treesize of output 8 [2025-04-29 11:13:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:30,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:30,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 11:13:30,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:30,241 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470412922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:30,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2025-04-29 11:13:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497568081] [2025-04-29 11:13:30,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:30,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 11:13:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 11:13:30,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 11:13:30,315 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 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-04-29 11:13:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:31,359 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2025-04-29 11:13:31,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-29 11:13:31,360 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-29 11:13:31,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:31,360 INFO L225 Difference]: With dead ends: 135 [2025-04-29 11:13:31,360 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:13:31,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=3155, Unknown=0, NotChecked=0, Total=3422 [2025-04-29 11:13:31,362 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:31,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 305 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:13:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:13:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2025-04-29 11:13:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 87 states have internal predecessors, (93), 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-04-29 11:13:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2025-04-29 11:13:31,365 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2025-04-29 11:13:31,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:31,365 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2025-04-29 11:13:31,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 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-04-29 11:13:31,365 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2025-04-29 11:13:31,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:13:31,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:31,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:31,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:31,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:31,566 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:31,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 817458614, now seen corresponding path program 2 times [2025-04-29 11:13:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:31,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091629480] [2025-04-29 11:13:31,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:31,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:13:31,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:13:31,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:31,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:31,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091629480] [2025-04-29 11:13:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091629480] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:31,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732732344] [2025-04-29 11:13:31,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:31,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:31,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:31,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:13:31,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:13:31,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:13:31,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:31,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:31,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:13:31,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:31,857 INFO L354 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-04-29 11:13:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:31,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:32,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732732344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:32,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-04-29 11:13:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453843067] [2025-04-29 11:13:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:32,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:13:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:32,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:13:32,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:13:32,219 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 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-04-29 11:13:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:32,361 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-04-29 11:13:32,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:13:32,362 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-29 11:13:32,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:32,363 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:13:32,363 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:13:32,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:13:32,363 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:32,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 293 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:13:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2025-04-29 11:13:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 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-04-29 11:13:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2025-04-29 11:13:32,365 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 45 [2025-04-29 11:13:32,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:32,365 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2025-04-29 11:13:32,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 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-04-29 11:13:32,365 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2025-04-29 11:13:32,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:13:32,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:32,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:32,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:13:32,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:13:32,566 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:32,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -215911336, now seen corresponding path program 2 times [2025-04-29 11:13:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:32,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937030103] [2025-04-29 11:13:32,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:32,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:13:32,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:13:32,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:32,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:32,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937030103] [2025-04-29 11:13:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937030103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:32,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555435691] [2025-04-29 11:13:32,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:32,841 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:32,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:13:32,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:13:32,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:13:32,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:32,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:13:32,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:32,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:33,142 INFO L354 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 16 treesize of output 8 [2025-04-29 11:13:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:33,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:33,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 11:13:33,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:33,313 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555435691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:33,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 34 [2025-04-29 11:13:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799310602] [2025-04-29 11:13:33,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:33,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:13:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:33,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:13:33,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:13:33,377 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 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-04-29 11:13:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:33,979 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2025-04-29 11:13:33,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-29 11:13:33,979 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 11:13:33,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:33,981 INFO L225 Difference]: With dead ends: 150 [2025-04-29 11:13:33,981 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:13:33,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=2749, Unknown=0, NotChecked=0, Total=2970 [2025-04-29 11:13:33,982 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:33,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 435 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:13:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:13:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-04-29 11:13:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 63 states have internal predecessors, (66), 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-04-29 11:13:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2025-04-29 11:13:33,983 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 47 [2025-04-29 11:13:33,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:33,983 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2025-04-29 11:13:33,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 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-04-29 11:13:33,983 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2025-04-29 11:13:33,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:13:33,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:33,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:33,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:34,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:13:34,184 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:34,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 9156788, now seen corresponding path program 3 times [2025-04-29 11:13:34,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:34,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888943488] [2025-04-29 11:13:34,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:34,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-04-29 11:13:34,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:13:34,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:34,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888943488] [2025-04-29 11:13:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888943488] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:34,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017868680] [2025-04-29 11:13:34,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:34,479 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:34,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:13:34,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-04-29 11:13:34,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:13:34,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:34,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:13:34,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:34,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:34,826 INFO L354 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 7 treesize of output 5 [2025-04-29 11:13:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017868680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:34,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:13:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45330430] [2025-04-29 11:13:34,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:34,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:13:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:13:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:13:34,877 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 24 states, 23 states have (on average 4.391304347826087) internal successors, (101), 24 states have internal predecessors, (101), 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-04-29 11:13:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:34,991 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-04-29 11:13:34,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:13:34,991 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.391304347826087) internal successors, (101), 24 states have internal predecessors, (101), 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 53 [2025-04-29 11:13:34,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:34,991 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:13:34,992 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:13:34,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:13:34,992 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:34,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 168 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:13:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2025-04-29 11:13:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 67 states have internal predecessors, (70), 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-04-29 11:13:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-04-29 11:13:34,993 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2025-04-29 11:13:34,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:34,994 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-04-29 11:13:34,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.391304347826087) internal successors, (101), 24 states have internal predecessors, (101), 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-04-29 11:13:34,994 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-04-29 11:13:34,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:13:34,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:34,994 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:35,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:13:35,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,194 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:35,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash -304930886, now seen corresponding path program 2 times [2025-04-29 11:13:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:35,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050730091] [2025-04-29 11:13:35,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:35,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:13:35,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:13:35,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 1 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:35,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050730091] [2025-04-29 11:13:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050730091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:35,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266585664] [2025-04-29 11:13:35,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:35,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:35,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:35,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:13:35,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:13:35,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:13:35,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:13:35,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:35,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-04-29 11:13:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:35,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266585664] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:36,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-29 11:13:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800475428] [2025-04-29 11:13:36,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:36,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:13:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:13:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:13:36,012 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 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-04-29 11:13:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:36,168 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-04-29 11:13:36,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:13:36,168 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 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 57 [2025-04-29 11:13:36,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:36,169 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:13:36,169 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:13:36,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:13:36,169 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:36,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 303 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:13:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-04-29 11:13:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 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-04-29 11:13:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-04-29 11:13:36,171 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 57 [2025-04-29 11:13:36,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:36,171 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-04-29 11:13:36,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 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-04-29 11:13:36,171 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-04-29 11:13:36,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-29 11:13:36,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:36,171 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:36,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:36,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-29 11:13:36,372 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:36,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1956097495, now seen corresponding path program 4 times [2025-04-29 11:13:36,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:36,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31848013] [2025-04-29 11:13:36,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:36,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:13:36,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 61 statements. [2025-04-29 11:13:36,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:37,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31848013] [2025-04-29 11:13:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31848013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:37,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904574934] [2025-04-29 11:13:37,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:37,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:37,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:37,417 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:37,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:13:37,471 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:13:37,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 61 statements. [2025-04-29 11:13:37,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:37,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-29 11:13:37,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:37,651 INFO L354 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 14 treesize of output 10 [2025-04-29 11:13:39,840 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:39,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 119 [2025-04-29 11:13:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 43 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:39,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:41,703 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:41,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 117 [2025-04-29 11:13:41,730 INFO L354 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 59 treesize of output 51 [2025-04-29 11:13:41,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:41,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 45 [2025-04-29 11:13:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904574934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:42,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 102 [2025-04-29 11:13:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72991873] [2025-04-29 11:13:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:42,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-04-29 11:13:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:42,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-04-29 11:13:42,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1024, Invalid=9278, Unknown=0, NotChecked=0, Total=10302 [2025-04-29 11:13:42,125 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 102 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 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-04-29 11:13:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:43,461 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2025-04-29 11:13:43,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-29 11:13:43,461 INFO L79 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 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 61 [2025-04-29 11:13:43,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:43,462 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:13:43,462 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:13:43,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1561, Invalid=12245, Unknown=0, NotChecked=0, Total=13806 [2025-04-29 11:13:43,464 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:43,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 330 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 11:13:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:13:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-04-29 11:13:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 74 states have internal predecessors, (77), 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-04-29 11:13:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-04-29 11:13:43,468 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 61 [2025-04-29 11:13:43,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:43,468 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-04-29 11:13:43,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 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-04-29 11:13:43,468 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-04-29 11:13:43,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:13:43,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:43,469 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:43,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:13:43,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-29 11:13:43,673 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:43,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1246405737, now seen corresponding path program 5 times [2025-04-29 11:13:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:43,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036484183] [2025-04-29 11:13:43,674 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:43,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 5 equivalence classes. [2025-04-29 11:13:43,697 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:13:43,697 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:13:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:43,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036484183] [2025-04-29 11:13:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036484183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:43,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884926522] [2025-04-29 11:13:43,980 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:43,982 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:43,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:13:44,037 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 5 equivalence classes. [2025-04-29 11:13:44,075 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:13:44,075 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:13:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:44,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 11:13:44,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:44,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:44,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:44,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:44,255 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884926522] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:44,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 26 [2025-04-29 11:13:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557145343] [2025-04-29 11:13:44,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:44,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:13:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:44,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:13:44,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:13:44,306 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:44,613 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2025-04-29 11:13:44,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:13:44,614 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-04-29 11:13:44,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:44,614 INFO L225 Difference]: With dead ends: 123 [2025-04-29 11:13:44,614 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:13:44,615 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:13:44,615 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:44,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 583 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:13:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-04-29 11:13:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 77 states have internal predecessors, (80), 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-04-29 11:13:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2025-04-29 11:13:44,616 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 64 [2025-04-29 11:13:44,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:44,616 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2025-04-29 11:13:44,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:44,616 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2025-04-29 11:13:44,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 11:13:44,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:44,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:44,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:44,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-29 11:13:44,817 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:44,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash -25617459, now seen corresponding path program 6 times [2025-04-29 11:13:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:44,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206460786] [2025-04-29 11:13:44,818 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:13:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:44,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 5 equivalence classes. [2025-04-29 11:13:44,839 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:13:44,839 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:13:44,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:45,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206460786] [2025-04-29 11:13:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206460786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:45,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919799664] [2025-04-29 11:13:45,078 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:13:45,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:45,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:45,080 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:45,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:13:45,138 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 5 equivalence classes. [2025-04-29 11:13:45,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:13:45,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:13:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:45,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:13:45,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:45,258 INFO L354 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-04-29 11:13:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 62 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:45,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 62 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:45,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919799664] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:45,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:45,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-04-29 11:13:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540715065] [2025-04-29 11:13:45,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:45,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:13:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:45,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:13:45,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:13:45,616 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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-04-29 11:13:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:45,801 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2025-04-29 11:13:45,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:13:45,802 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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 67 [2025-04-29 11:13:45,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:45,802 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:13:45,802 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:13:45,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:13:45,803 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 55 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:45,803 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 240 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:13:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2025-04-29 11:13:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 81 states have internal predecessors, (84), 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-04-29 11:13:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2025-04-29 11:13:45,805 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 67 [2025-04-29 11:13:45,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:45,806 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2025-04-29 11:13:45,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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-04-29 11:13:45,806 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2025-04-29 11:13:45,806 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 11:13:45,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:45,806 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:45,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:13:46,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:46,007 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:46,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1581822381, now seen corresponding path program 3 times [2025-04-29 11:13:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:46,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072654658] [2025-04-29 11:13:46,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:46,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-04-29 11:13:46,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:13:46,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:13:46,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:46,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072654658] [2025-04-29 11:13:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072654658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:46,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613550532] [2025-04-29 11:13:46,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:46,248 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:46,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:13:46,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-04-29 11:13:46,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:13:46,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:13:46,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:13:46,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:46,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:46,621 INFO L354 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 7 treesize of output 5 [2025-04-29 11:13:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613550532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:46,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:46,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-04-29 11:13:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236166593] [2025-04-29 11:13:46,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:46,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:13:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:46,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:13:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:13:46,650 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 22 states, 21 states have (on average 5.0) internal successors, (105), 22 states have internal predecessors, (105), 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-04-29 11:13:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:46,773 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2025-04-29 11:13:46,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:13:46,773 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 22 states have internal predecessors, (105), 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 71 [2025-04-29 11:13:46,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:46,774 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:13:46,774 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:13:46,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:13:46,774 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:46,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 204 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:13:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-04-29 11:13:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 85 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2025-04-29 11:13:46,776 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 71 [2025-04-29 11:13:46,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:46,776 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2025-04-29 11:13:46,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 22 states have internal predecessors, (105), 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-04-29 11:13:46,776 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2025-04-29 11:13:46,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-29 11:13:46,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:46,776 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:46,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:46,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:46,977 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:46,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1039240258, now seen corresponding path program 7 times [2025-04-29 11:13:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:46,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437127244] [2025-04-29 11:13:46,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:13:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:46,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 11:13:47,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:13:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 25 proven. 82 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:47,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:47,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437127244] [2025-04-29 11:13:47,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437127244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:47,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293163279] [2025-04-29 11:13:47,308 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:13:47,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:47,310 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:47,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:13:47,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 11:13:47,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:13:47,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:47,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:47,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:13:47,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:47,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 25 proven. 82 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:47,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:47,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:47,583 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 25 proven. 82 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293163279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:47,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2025-04-29 11:13:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383801716] [2025-04-29 11:13:47,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:47,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:13:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:13:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:13:47,652 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 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-04-29 11:13:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:47,904 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2025-04-29 11:13:47,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:13:47,905 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 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 75 [2025-04-29 11:13:47,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:47,905 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:13:47,905 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:13:47,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:13:47,906 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:47,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 611 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:13:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-04-29 11:13:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 86 states have (on average 1.058139534883721) internal successors, (91), 88 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2025-04-29 11:13:47,907 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 75 [2025-04-29 11:13:47,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:47,907 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2025-04-29 11:13:47,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 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-04-29 11:13:47,908 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2025-04-29 11:13:47,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-04-29 11:13:47,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:47,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:47,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 11:13:48,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-29 11:13:48,108 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:48,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -925979060, now seen corresponding path program 8 times [2025-04-29 11:13:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:48,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316500164] [2025-04-29 11:13:48,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:48,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-29 11:13:48,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:13:48,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 108 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:48,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316500164] [2025-04-29 11:13:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316500164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:48,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114057226] [2025-04-29 11:13:48,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:48,424 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:13:48,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-29 11:13:48,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:13:48,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:48,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:48,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:13:48,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:48,619 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:48,822 INFO L354 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 16 treesize of output 8 [2025-04-29 11:13:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 9 proven. 98 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-29 11:13:48,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:49,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 11:13:49,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:49,053 INFO L354 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 16 treesize of output 12 [2025-04-29 11:13:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 9 proven. 98 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-29 11:13:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114057226] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:49,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 21] total 42 [2025-04-29 11:13:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898267421] [2025-04-29 11:13:49,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:49,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 11:13:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:49,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 11:13:49,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1612, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:13:49,129 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 42 states, 42 states have (on average 3.357142857142857) internal successors, (141), 42 states have internal predecessors, (141), 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-04-29 11:13:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:50,245 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2025-04-29 11:13:50,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-29 11:13:50,245 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.357142857142857) internal successors, (141), 42 states have internal predecessors, (141), 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 78 [2025-04-29 11:13:50,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:50,246 INFO L225 Difference]: With dead ends: 150 [2025-04-29 11:13:50,246 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:13:50,246 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=4408, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:13:50,247 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:50,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 767 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:13:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:13:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2025-04-29 11:13:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.053763440860215) internal successors, (98), 95 states have internal predecessors, (98), 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-04-29 11:13:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2025-04-29 11:13:50,249 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 78 [2025-04-29 11:13:50,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:50,249 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2025-04-29 11:13:50,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.357142857142857) internal successors, (141), 42 states have internal predecessors, (141), 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-04-29 11:13:50,249 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2025-04-29 11:13:50,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-04-29 11:13:50,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:50,249 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:50,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-29 11:13:50,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-29 11:13:50,450 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:13:50,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1040452188, now seen corresponding path program 4 times [2025-04-29 11:13:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:50,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335310020] [2025-04-29 11:13:50,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:50,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:13:50,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 85 statements. [2025-04-29 11:13:50,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-29 11:13:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:52,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335310020] [2025-04-29 11:13:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335310020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:52,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068984442] [2025-04-29 11:13:52,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:52,528 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:52,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:13:52,591 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:13:52,624 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 85 statements. [2025-04-29 11:13:52,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:52,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:52,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-29 11:13:52,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:52,654 INFO L354 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 14 treesize of output 10 [2025-04-29 11:13:58,749 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:58,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 180 [2025-04-29 11:13:58,972 INFO L325 Elim1Store]: treesize reduction 16, result has 71.4 percent of original size [2025-04-29 11:13:58,972 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 62 [2025-04-29 11:13:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 63 proven. 41 refuted. 1 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:13:59,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:04,296 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:14:04,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 174 [2025-04-29 11:14:04,688 INFO L354 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 74 treesize of output 64 [2025-04-29 11:14:04,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 96 [2025-04-29 11:14:04,704 INFO L354 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 5 treesize of output 3 [2025-04-29 11:14:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:14:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068984442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:04,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 44, 44] total 131 [2025-04-29 11:14:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036897679] [2025-04-29 11:14:04,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:04,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-04-29 11:14:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-04-29 11:14:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=15826, Unknown=1, NotChecked=0, Total=17292 [2025-04-29 11:14:04,735 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 132 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 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-04-29 11:14:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:24,413 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2025-04-29 11:14:24,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-29 11:14:24,413 INFO L79 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 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 85 [2025-04-29 11:14:24,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:24,414 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:14:24,414 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:14:24,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7646 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=3252, Invalid=22828, Unknown=2, NotChecked=0, Total=26082 [2025-04-29 11:14:24,415 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:24,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 473 Invalid, 3476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3459 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2025-04-29 11:14:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:14:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-04-29 11:14:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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-04-29 11:14:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2025-04-29 11:14:24,417 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 85 [2025-04-29 11:14:24,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:24,417 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2025-04-29 11:14:24,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 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-04-29 11:14:24,417 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2025-04-29 11:14:24,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-29 11:14:24,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:24,417 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:24,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:14:24,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-29 11:14:24,618 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-29 11:14:24,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -771742957, now seen corresponding path program 9 times [2025-04-29 11:14:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:24,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980729727] [2025-04-29 11:14:24,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:24,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:24,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 7 equivalence classes. [2025-04-29 11:14:24,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 89 of 89 statements. [2025-04-29 11:14:24,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-29 11:14:24,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15