./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca-2.i --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/openbsd_cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:34:08,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:34:08,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:34:08,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:34:08,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:34:08,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:34:08,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:34:08,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:34:08,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:34:08,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:34:08,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:34:08,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:34:08,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:34:08,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:34:08,534 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:34:08,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:34:08,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:34:08,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:34:08,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:34:08,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:08,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:08,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:08,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:08,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:34:08,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:08,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:08,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:34:08,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:34:08,537 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 -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2025-04-30 10:34:08,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:34:08,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:34:08,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:34:08,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:34:08,761 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:34:08,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca-2.i [2025-04-30 10:34:10,007 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c4cd82c/192b0845a30b4bb4940452fc6680d75e/FLAG41b1636e2 [2025-04-30 10:34:10,261 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:34:10,261 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca-2.i [2025-04-30 10:34:10,269 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c4cd82c/192b0845a30b4bb4940452fc6680d75e/FLAG41b1636e2 [2025-04-30 10:34:11,008 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c4cd82c/192b0845a30b4bb4940452fc6680d75e [2025-04-30 10:34:11,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:34:11,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:34:11,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:11,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:34:11,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:34:11,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756166e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11, skipping insertion in model container [2025-04-30 10:34:11,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:34:11,299 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-30 10:34:11,301 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-30 10:34:11,305 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:11,311 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:34:11,351 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:11,369 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:34:11,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11 WrapperNode [2025-04-30 10:34:11,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:11,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:11,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:34:11,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:34:11,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,396 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-04-30 10:34:11,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:11,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:34:11,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:34:11,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:34:11,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,416 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 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-30 10:34:11,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:34:11,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:34:11,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:34:11,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:34:11,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (1/1) ... [2025-04-30 10:34:11,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:11,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:11,463 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-30 10:34:11,465 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-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:34:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:34:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:34:11,558 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:34:11,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:34:11,689 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-04-30 10:34:11,690 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:34:11,695 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:34:11,695 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:34:11,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:11 BoogieIcfgContainer [2025-04-30 10:34:11,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:34:11,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:34:11,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:34:11,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:34:11,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:34:11" (1/3) ... [2025-04-30 10:34:11,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a5bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:11, skipping insertion in model container [2025-04-30 10:34:11,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:11" (2/3) ... [2025-04-30 10:34:11,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a5bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:11, skipping insertion in model container [2025-04-30 10:34:11,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:11" (3/3) ... [2025-04-30 10:34:11,704 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2025-04-30 10:34:11,714 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:34:11,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncpy-alloca-2.i that has 1 procedures, 37 locations, 45 edges, 1 initial locations, 3 loop locations, and 11 error locations. [2025-04-30 10:34:11,744 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:34:11,753 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;@4c69440a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:34:11,754 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:34:11,756 INFO L278 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.8) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:11,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:11,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:11,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:11,760 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:11,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:34:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:11,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889761353] [2025-04-30 10:34:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:11,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:11,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:11,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:11,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,939 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-30 10:34:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:11,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889761353] [2025-04-30 10:34:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889761353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381154349] [2025-04-30 10:34:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:11,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:11,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:11,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:11,966 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.8) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-30 10:34:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,008 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-04-30 10:34:12,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:12,012 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-30 10:34:12,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,017 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:34:12,017 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:34:12,018 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-30 10:34:12,023 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 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-30 10:34:12,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:34:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-30 10:34:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-04-30 10:34:12,054 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 7 [2025-04-30 10:34:12,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,054 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-04-30 10:34:12,054 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-30 10:34:12,054 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-04-30 10:34:12,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:12,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:34:12,056 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:12,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029160, now seen corresponding path program 1 times [2025-04-30 10:34:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358616047] [2025-04-30 10:34:12,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:12,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:12,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,150 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-30 10:34:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358616047] [2025-04-30 10:34:12,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358616047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:12,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135887743] [2025-04-30 10:34:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:12,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:12,152 INFO L87 Difference]: Start difference. First operand 38 states and 45 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-30 10:34:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,174 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-04-30 10:34:12,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:12,175 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-30 10:34:12,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,175 INFO L225 Difference]: With dead ends: 36 [2025-04-30 10:34:12,175 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:34:12,176 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-30 10:34:12,176 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:34:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-30 10:34:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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-30 10:34:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-04-30 10:34:12,181 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-04-30 10:34:12,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,181 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-04-30 10:34:12,181 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-30 10:34:12,181 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-04-30 10:34:12,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:12,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:34:12,182 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:12,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029161, now seen corresponding path program 1 times [2025-04-30 10:34:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844423129] [2025-04-30 10:34:12,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,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-30 10:34:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844423129] [2025-04-30 10:34:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844423129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:12,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:12,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38076451] [2025-04-30 10:34:12,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:12,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:12,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:12,371 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:34:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,393 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-04-30 10:34:12,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:12,394 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:34:12,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,395 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:34:12,396 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:34:12,396 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-30 10:34:12,397 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:34:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:34:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 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-30 10:34:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-04-30 10:34:12,399 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 7 [2025-04-30 10:34:12,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,399 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-04-30 10:34:12,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:34:12,399 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-04-30 10:34:12,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:12,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:34:12,401 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:12,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:34:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252950222] [2025-04-30 10:34:12,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:12,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,540 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-30 10:34:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252950222] [2025-04-30 10:34:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252950222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244471042] [2025-04-30 10:34:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:12,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:12,542 INFO L87 Difference]: Start difference. First operand 37 states and 44 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-30 10:34:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,610 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-04-30 10:34:12,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:12,611 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-30 10:34:12,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,611 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:34:12,612 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:34:12,613 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-30 10:34:12,613 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:34:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-04-30 10:34:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 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-30 10:34:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-04-30 10:34:12,618 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 7 [2025-04-30 10:34:12,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,618 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-04-30 10:34:12,618 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-30 10:34:12,618 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-04-30 10:34:12,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:12,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:34:12,619 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:12,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876203, now seen corresponding path program 1 times [2025-04-30 10:34:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478405710] [2025-04-30 10:34:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:12,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,729 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-30 10:34:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478405710] [2025-04-30 10:34:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478405710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680353417] [2025-04-30 10:34:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:12,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:12,730 INFO L87 Difference]: Start difference. First operand 39 states and 47 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-30 10:34:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,750 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-04-30 10:34:12,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:12,753 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-30 10:34:12,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,753 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:34:12,753 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:34:12,753 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-30 10:34:12,754 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:34:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-04-30 10:34:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-04-30 10:34:12,756 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2025-04-30 10:34:12,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,756 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-04-30 10:34:12,756 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-30 10:34:12,756 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-04-30 10:34:12,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:34:12,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,756 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:34:12,756 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:12,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:34:12,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736647332] [2025-04-30 10:34:12,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:12,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:12,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,917 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-30 10:34:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736647332] [2025-04-30 10:34:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736647332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:12,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505219315] [2025-04-30 10:34:12,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:12,921 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-30 10:34:12,922 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-30 10:34:12,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:12,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:12,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:34:12,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:13,023 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-30 10:34:13,032 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 8 treesize of output 1 [2025-04-30 10:34:13,167 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-30 10:34:13,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:13,310 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-30 10:34:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505219315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:13,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-30 10:34:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422389532] [2025-04-30 10:34:13,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:34:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:34:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:34:13,312 INFO L87 Difference]: Start difference. First operand 37 states and 45 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-30 10:34:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,469 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-04-30 10:34:13,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:13,469 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 10 [2025-04-30 10:34:13,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,470 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:34:13,470 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:34:13,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:34:13,471 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:34:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-04-30 10:34:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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-30 10:34:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-04-30 10:34:13,477 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 10 [2025-04-30 10:34:13,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,477 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-04-30 10:34:13,477 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-30 10:34:13,477 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-04-30 10:34:13,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:13,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:13,678 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,SelfDestructingSolverStorable5 [2025-04-30 10:34:13,678 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:13,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1846915316, now seen corresponding path program 1 times [2025-04-30 10:34:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115347616] [2025-04-30 10:34:13,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:13,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:13,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,752 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-30 10:34:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115347616] [2025-04-30 10:34:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115347616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195170324] [2025-04-30 10:34:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:13,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:13,755 INFO L87 Difference]: Start difference. First operand 34 states and 41 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-30 10:34:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,803 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-04-30 10:34:13,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:13,803 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-30 10:34:13,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,803 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:34:13,803 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:34:13,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:13,804 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 87 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:34:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-04-30 10:34:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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-30 10:34:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-04-30 10:34:13,806 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2025-04-30 10:34:13,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,807 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-04-30 10:34:13,807 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-30 10:34:13,807 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-04-30 10:34:13,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:13,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:34:13,807 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:13,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1846915315, now seen corresponding path program 1 times [2025-04-30 10:34:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748110807] [2025-04-30 10:34:13,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,912 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-30 10:34:13,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748110807] [2025-04-30 10:34:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748110807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:34:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278462605] [2025-04-30 10:34:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:13,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:13,914 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-30 10:34:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,982 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-04-30 10:34:13,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:13,982 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-30 10:34:13,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,983 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:34:13,983 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:34:13,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:13,983 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:34:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-04-30 10:34:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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-30 10:34:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-04-30 10:34:13,989 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2025-04-30 10:34:13,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,989 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-04-30 10:34:13,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-30 10:34:13,989 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-04-30 10:34:13,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:13,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:34:13,990 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:13,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1419799938, now seen corresponding path program 1 times [2025-04-30 10:34:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993172777] [2025-04-30 10:34:13,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,094 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-30 10:34:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993172777] [2025-04-30 10:34:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993172777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033139560] [2025-04-30 10:34:14,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:14,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:14,095 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,164 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-04-30 10:34:14,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:14,165 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-30 10:34:14,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,165 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:34:14,165 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:34:14,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:14,166 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 83 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:34:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-30 10:34:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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-30 10:34:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-04-30 10:34:14,169 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 12 [2025-04-30 10:34:14,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,169 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-04-30 10:34:14,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,169 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-04-30 10:34:14,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:14,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:34:14,169 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:14,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1419799937, now seen corresponding path program 1 times [2025-04-30 10:34:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036280040] [2025-04-30 10:34:14,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:14,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,431 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-30 10:34:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036280040] [2025-04-30 10:34:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036280040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:34:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920580159] [2025-04-30 10:34:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:14,432 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,541 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-04-30 10:34:14,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:14,541 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-30 10:34:14,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,542 INFO L225 Difference]: With dead ends: 47 [2025-04-30 10:34:14,542 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:34:14,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:14,542 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:34:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-04-30 10:34:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 45 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-30 10:34:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-04-30 10:34:14,544 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 12 [2025-04-30 10:34:14,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,544 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-04-30 10:34:14,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,544 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-04-30 10:34:14,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:14,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:34:14,550 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:14,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1418447398, now seen corresponding path program 1 times [2025-04-30 10:34:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372919635] [2025-04-30 10:34:14,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:14,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:14,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,597 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-30 10:34:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372919635] [2025-04-30 10:34:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372919635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590928002] [2025-04-30 10:34:14,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:14,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:14,599 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,614 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-04-30 10:34:14,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:14,614 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-30 10:34:14,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,615 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:34:14,615 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:34:14,615 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-30 10:34:14,615 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:34:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-30 10:34:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 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-30 10:34:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-04-30 10:34:14,617 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2025-04-30 10:34:14,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,617 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-04-30 10:34:14,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,617 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-04-30 10:34:14,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:14,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:34:14,620 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:14,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -739741567, now seen corresponding path program 1 times [2025-04-30 10:34:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158484303] [2025-04-30 10:34:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:14,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,773 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-30 10:34:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158484303] [2025-04-30 10:34:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158484303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:34:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314249878] [2025-04-30 10:34:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:14,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:14,775 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,835 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-04-30 10:34:14,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:14,835 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-30 10:34:14,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,835 INFO L225 Difference]: With dead ends: 47 [2025-04-30 10:34:14,835 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:34:14,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:14,836 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:34:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-04-30 10:34:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 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-30 10:34:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-04-30 10:34:14,838 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2025-04-30 10:34:14,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,838 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-04-30 10:34:14,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,838 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-04-30 10:34:14,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:14,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:34:14,839 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:14,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -738389028, now seen corresponding path program 1 times [2025-04-30 10:34:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10641821] [2025-04-30 10:34:14,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,887 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-30 10:34:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10641821] [2025-04-30 10:34:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10641821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787711150] [2025-04-30 10:34:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:14,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:14,888 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,905 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-04-30 10:34:14,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:14,905 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-30 10:34:14,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,905 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:34:14,905 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:14,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:14,906 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2025-04-30 10:34:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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-30 10:34:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-04-30 10:34:14,907 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 12 [2025-04-30 10:34:14,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,907 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-04-30 10:34:14,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-30 10:34:14,907 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-04-30 10:34:14,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:34:14,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,908 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:34:14,908 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:14,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash -196729917, now seen corresponding path program 1 times [2025-04-30 10:34:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842668048] [2025-04-30 10:34:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:14,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:14,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842668048] [2025-04-30 10:34:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842668048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362135167] [2025-04-30 10:34:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:15,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:15,002 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-30 10:34:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,023 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-04-30 10:34:15,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:15,023 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-30 10:34:15,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,025 INFO L225 Difference]: With dead ends: 50 [2025-04-30 10:34:15,025 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:34:15,026 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:15,027 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:34:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-04-30 10:34:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 48 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-30 10:34:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-04-30 10:34:15,031 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 16 [2025-04-30 10:34:15,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,031 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-04-30 10:34:15,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-30 10:34:15,032 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-04-30 10:34:15,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:34:15,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,033 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:34:15,033 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:15,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -783535931, now seen corresponding path program 1 times [2025-04-30 10:34:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361319198] [2025-04-30 10:34:15,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:15,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:15,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:15,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361319198] [2025-04-30 10:34:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361319198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:34:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381126194] [2025-04-30 10:34:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:34:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:34:15,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:15,190 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-30 10:34:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,243 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-30 10:34:15,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:15,243 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-30 10:34:15,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,243 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:34:15,243 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:34:15,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:15,244 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:34:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-04-30 10:34:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 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-30 10:34:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-04-30 10:34:15,246 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 16 [2025-04-30 10:34:15,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,246 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-04-30 10:34:15,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-30 10:34:15,246 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-04-30 10:34:15,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:34:15,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,247 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:34:15,247 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:15,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1794653181, now seen corresponding path program 1 times [2025-04-30 10:34:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857661528] [2025-04-30 10:34:15,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:15,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:15,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857661528] [2025-04-30 10:34:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857661528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:34:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665784042] [2025-04-30 10:34:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:15,420 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-30 10:34:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,481 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2025-04-30 10:34:15,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:15,482 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-30 10:34:15,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,482 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:34:15,482 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:34:15,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:15,483 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 178 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:34:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2025-04-30 10:34:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 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-30 10:34:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-04-30 10:34:15,485 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 16 [2025-04-30 10:34:15,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,485 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-04-30 10:34:15,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-30 10:34:15,485 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-04-30 10:34:15,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:34:15,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:34:15,486 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:15,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1821727307, now seen corresponding path program 1 times [2025-04-30 10:34:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040642947] [2025-04-30 10:34:15,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:34:15,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:34:15,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,522 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-30 10:34:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040642947] [2025-04-30 10:34:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040642947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422482887] [2025-04-30 10:34:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:15,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:15,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:15,524 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,561 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-04-30 10:34:15,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:15,561 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:34:15,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,562 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:34:15,562 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:34:15,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:15,562 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:34:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-30 10:34:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 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-30 10:34:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-04-30 10:34:15,564 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 17 [2025-04-30 10:34:15,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,568 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-04-30 10:34:15,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:15,568 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-04-30 10:34:15,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:34:15,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:34:15,568 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:15,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1821727306, now seen corresponding path program 1 times [2025-04-30 10:34:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681823739] [2025-04-30 10:34:15,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:34:15,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:34:15,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,631 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-30 10:34:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681823739] [2025-04-30 10:34:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681823739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318385727] [2025-04-30 10:34:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:15,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:15,633 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,651 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-04-30 10:34:15,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:15,652 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:34:15,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,652 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:34:15,652 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:34:15,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:15,653 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:34:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-30 10:34:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2258064516129032) 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-30 10:34:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-04-30 10:34:15,654 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 17 [2025-04-30 10:34:15,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,654 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-04-30 10:34:15,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:15,655 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2025-04-30 10:34:15,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:34:15,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:34:15,655 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:15,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1462122740, now seen corresponding path program 1 times [2025-04-30 10:34:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132821384] [2025-04-30 10:34:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:34:15,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:34:15,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,910 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-30 10:34:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132821384] [2025-04-30 10:34:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132821384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:34:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681763352] [2025-04-30 10:34:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:15,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:15,911 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,051 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2025-04-30 10:34:16,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:16,051 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:34:16,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,051 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:34:16,051 INFO L226 Difference]: Without dead ends: 71 [2025-04-30 10:34:16,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:34:16,052 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-30 10:34:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-04-30 10:34:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 70 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-30 10:34:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2025-04-30 10:34:16,054 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 17 [2025-04-30 10:34:16,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,054 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2025-04-30 10:34:16,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,054 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2025-04-30 10:34:16,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:16,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,054 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-30 10:34:16,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:34:16,054 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:16,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1669119803, now seen corresponding path program 1 times [2025-04-30 10:34:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859307966] [2025-04-30 10:34:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:16,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:16,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,141 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-30 10:34:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859307966] [2025-04-30 10:34:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859307966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:16,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9185644] [2025-04-30 10:34:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:16,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:16,142 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,156 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-04-30 10:34:16,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:16,157 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:34:16,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,157 INFO L225 Difference]: With dead ends: 70 [2025-04-30 10:34:16,157 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:34:16,157 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-30 10:34:16,157 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:34:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-30 10:34:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 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-30 10:34:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-04-30 10:34:16,159 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2025-04-30 10:34:16,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,159 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-04-30 10:34:16,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,159 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-04-30 10:34:16,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:16,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,160 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:16,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:34:16,160 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:16,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1205667897, now seen corresponding path program 1 times [2025-04-30 10:34:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970108926] [2025-04-30 10:34:16,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:16,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:16,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970108926] [2025-04-30 10:34:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970108926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:16,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499688985] [2025-04-30 10:34:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:16,366 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-30 10:34:16,367 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-30 10:34:16,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:16,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:16,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:34:16,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:16,683 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-30 10:34:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499688985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:16,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-04-30 10:34:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897638440] [2025-04-30 10:34:16,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:34:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:34:16,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:34:16,706 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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-30 10:34:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,909 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-04-30 10:34:16,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:34:16,909 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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-30 10:34:16,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,910 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:34:16,910 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:34:16,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:16,911 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 241 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:34:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2025-04-30 10:34:16,913 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-30 10:34:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-30 10:34:16,913 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 19 [2025-04-30 10:34:16,914 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,914 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-30 10:34:16,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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-30 10:34:16,914 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-30 10:34:16,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:34:16,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:16,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:17,116 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,SelfDestructingSolverStorable20 [2025-04-30 10:34:17,117 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:17,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1279000877, now seen corresponding path program 1 times [2025-04-30 10:34:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796889764] [2025-04-30 10:34:17,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:17,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:17,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:17,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796889764] [2025-04-30 10:34:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796889764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:17,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166715428] [2025-04-30 10:34:17,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:17,412 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-30 10:34:17,431 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-30 10:34:17,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:17,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:17,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:34:17,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:17,526 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-30 10:34:17,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:17,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:17,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166715428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:18,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-04-30 10:34:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142719511] [2025-04-30 10:34:18,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:34:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:34:18,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:18,109 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 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-30 10:34:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:18,450 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-04-30 10:34:18,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:34:18,450 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 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) Word has length 20 [2025-04-30 10:34:18,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:18,450 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:34:18,450 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:34:18,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:18,452 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:18,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 150 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:34:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-30 10:34:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 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-30 10:34:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-04-30 10:34:18,454 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 20 [2025-04-30 10:34:18,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:18,456 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-04-30 10:34:18,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 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-30 10:34:18,456 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-04-30 10:34:18,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:34:18,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:18,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:18,462 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-30 10:34:18,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:18,657 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:18,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1991475288, now seen corresponding path program 1 times [2025-04-30 10:34:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:18,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821751847] [2025-04-30 10:34:18,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:18,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:34:18,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:34:18,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:19,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821751847] [2025-04-30 10:34:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821751847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:19,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779896004] [2025-04-30 10:34:19,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:19,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:19,015 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-30 10:34:19,018 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-30 10:34:19,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:34:19,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:34:19,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:19,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-30 10:34:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:19,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:19,097 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-30 10:34:19,100 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-30 10:34:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:19,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779896004] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:19,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-04-30 10:34:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911976702] [2025-04-30 10:34:19,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:19,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:34:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:19,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:34:19,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:19,871 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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-30 10:34:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:20,738 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-04-30 10:34:20,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:34:20,738 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 21 [2025-04-30 10:34:20,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:20,739 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:34:20,739 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:34:20,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=2362, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:34:20,741 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:20,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 206 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:34:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-04-30 10:34:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 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-30 10:34:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2025-04-30 10:34:20,745 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 21 [2025-04-30 10:34:20,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:20,745 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2025-04-30 10:34:20,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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-30 10:34:20,745 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2025-04-30 10:34:20,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:34:20,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:20,746 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:20,753 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-30 10:34:20,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:20,947 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:20,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash 557073943, now seen corresponding path program 2 times [2025-04-30 10:34:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:20,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242587040] [2025-04-30 10:34:20,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:20,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:34:20,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:20,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242587040] [2025-04-30 10:34:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242587040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:21,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081423484] [2025-04-30 10:34:21,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:21,274 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-30 10:34:21,275 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-30 10:34:21,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:34:21,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:21,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:34:21,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:21,388 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-30 10:34:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:21,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:21,474 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-30 10:34:21,475 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-30 10:34:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081423484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:21,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 25 [2025-04-30 10:34:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907790591] [2025-04-30 10:34:21,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:34:21,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:34:21,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:21,518 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,791 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2025-04-30 10:34:21,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:34:21,795 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:34:21,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,795 INFO L225 Difference]: With dead ends: 110 [2025-04-30 10:34:21,795 INFO L226 Difference]: Without dead ends: 110 [2025-04-30 10:34:21,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:34:21,797 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 332 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-30 10:34:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2025-04-30 10:34:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 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-30 10:34:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2025-04-30 10:34:21,799 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 24 [2025-04-30 10:34:21,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,799 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2025-04-30 10:34:21,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,799 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2025-04-30 10:34:21,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:34:21,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:22,000 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,SelfDestructingSolverStorable23 [2025-04-30 10:34:22,000 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:22,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash 71355874, now seen corresponding path program 1 times [2025-04-30 10:34:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:22,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919398527] [2025-04-30 10:34:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:22,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:34:22,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:34:22,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:22,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919398527] [2025-04-30 10:34:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919398527] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:22,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275604403] [2025-04-30 10:34:22,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:22,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:22,358 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-30 10:34:22,360 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-30 10:34:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:34:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:34:22,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-30 10:34:22,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:22,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:22,433 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-30 10:34:22,438 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-30 10:34:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275604403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:23,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-04-30 10:34:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821449451] [2025-04-30 10:34:23,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:23,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:34:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:23,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:34:23,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:23,132 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 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-30 10:34:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:24,063 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2025-04-30 10:34:24,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-30 10:34:24,064 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 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 25 [2025-04-30 10:34:24,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:24,064 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:34:24,064 INFO L226 Difference]: Without dead ends: 99 [2025-04-30 10:34:24,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=2976, Unknown=0, NotChecked=0, Total=3306 [2025-04-30 10:34:24,065 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:24,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-30 10:34:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2025-04-30 10:34:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 83 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-30 10:34:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-04-30 10:34:24,067 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 25 [2025-04-30 10:34:24,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:24,067 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-04-30 10:34:24,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 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-30 10:34:24,067 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-04-30 10:34:24,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:34:24,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:24,067 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:24,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:34:24,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,272 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:24,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1561004979, now seen corresponding path program 3 times [2025-04-30 10:34:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:24,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942551868] [2025-04-30 10:34:24,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:24,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-30 10:34:24,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:24,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:24,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942551868] [2025-04-30 10:34:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942551868] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:24,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566904239] [2025-04-30 10:34:24,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:24,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:24,502 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-30 10:34:24,504 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-30 10:34:24,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-30 10:34:24,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:24,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:24,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:34:24,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:24,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:24,827 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 21 treesize of output 17 [2025-04-30 10:34:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566904239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:24,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2025-04-30 10:34:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401487381] [2025-04-30 10:34:24,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:24,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:34:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:24,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:34:24,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:24,886 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 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-30 10:34:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:25,111 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2025-04-30 10:34:25,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:34:25,111 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 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) Word has length 27 [2025-04-30 10:34:25,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:25,112 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:34:25,112 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:34:25,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:34:25,112 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:25,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 373 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:34:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2025-04-30 10:34:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-04-30 10:34:25,114 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 27 [2025-04-30 10:34:25,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:25,116 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-04-30 10:34:25,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 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-30 10:34:25,117 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-04-30 10:34:25,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:34:25,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:25,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:25,124 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-30 10:34:25,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:25,322 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:25,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1146514113, now seen corresponding path program 2 times [2025-04-30 10:34:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:25,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310766157] [2025-04-30 10:34:25,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:25,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:34:25,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:25,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:25,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:25,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310766157] [2025-04-30 10:34:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310766157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:25,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138428173] [2025-04-30 10:34:25,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:25,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:25,733 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-30 10:34:25,734 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-30 10:34:25,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:34:25,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:25,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:25,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-30 10:34:25,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:25,809 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-30 10:34:25,813 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-30 10:34:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:26,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:26,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138428173] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:26,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-04-30 10:34:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854453054] [2025-04-30 10:34:26,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:26,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-30 10:34:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:26,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-30 10:34:26,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:34:26,594 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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-30 10:34:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:27,493 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2025-04-30 10:34:27,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:34:27,493 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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) Word has length 28 [2025-04-30 10:34:27,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:27,493 INFO L225 Difference]: With dead ends: 93 [2025-04-30 10:34:27,494 INFO L226 Difference]: Without dead ends: 93 [2025-04-30 10:34:27,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=335, Invalid=2971, Unknown=0, NotChecked=0, Total=3306 [2025-04-30 10:34:27,494 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:27,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 158 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-30 10:34:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2025-04-30 10:34:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 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-30 10:34:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2025-04-30 10:34:27,496 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 28 [2025-04-30 10:34:27,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:27,496 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2025-04-30 10:34:27,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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-30 10:34:27,496 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2025-04-30 10:34:27,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:34:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:27,497 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:27,503 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-30 10:34:27,697 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,SelfDestructingSolverStorable26 [2025-04-30 10:34:27,697 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:27,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -162478461, now seen corresponding path program 4 times [2025-04-30 10:34:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:27,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003968749] [2025-04-30 10:34:27,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:27,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-30 10:34:27,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:34:27,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:27,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:27,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003968749] [2025-04-30 10:34:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003968749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:27,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132500842] [2025-04-30 10:34:27,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:27,959 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-30 10:34:27,961 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-30 10:34:28,009 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-30 10:34:28,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:34:28,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:28,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:34:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:28,105 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-30 10:34:28,179 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 7 treesize of output 3 [2025-04-30 10:34:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:28,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:28,205 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-30 10:34:28,206 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-30 10:34:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:28,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132500842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:28,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 26 [2025-04-30 10:34:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142753207] [2025-04-30 10:34:28,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:28,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:34:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:28,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:34:28,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:34:28,245 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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-30 10:34:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:28,442 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2025-04-30 10:34:28,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:34:28,443 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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 32 [2025-04-30 10:34:28,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:28,443 INFO L225 Difference]: With dead ends: 143 [2025-04-30 10:34:28,443 INFO L226 Difference]: Without dead ends: 143 [2025-04-30 10:34:28,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:34:28,444 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:28,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 616 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-30 10:34:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2025-04-30 10:34:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 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-30 10:34:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2025-04-30 10:34:28,446 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 32 [2025-04-30 10:34:28,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:28,446 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2025-04-30 10:34:28,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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-30 10:34:28,446 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2025-04-30 10:34:28,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:34:28,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:28,446 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:28,455 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-30 10:34:28,653 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,SelfDestructingSolverStorable27 [2025-04-30 10:34:28,653 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:28,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -740201852, now seen corresponding path program 2 times [2025-04-30 10:34:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:28,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953639833] [2025-04-30 10:34:28,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:28,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:34:28,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:34:28,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:29,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953639833] [2025-04-30 10:34:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953639833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:29,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549227388] [2025-04-30 10:34:29,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:29,390 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-30 10:34:29,390 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-30 10:34:29,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:34:29,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:34:29,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:29,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-04-30 10:34:29,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:29,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:29,493 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-30 10:34:29,499 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-30 10:34:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:30,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549227388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:30,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 53 [2025-04-30 10:34:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795460106] [2025-04-30 10:34:30,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:30,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:34:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:30,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:34:30,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2628, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:30,990 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 54 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 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-30 10:34:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:35,990 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2025-04-30 10:34:35,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-30 10:34:35,990 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-30 10:34:35,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:35,991 INFO L225 Difference]: With dead ends: 245 [2025-04-30 10:34:35,991 INFO L226 Difference]: Without dead ends: 245 [2025-04-30 10:34:35,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1919, Invalid=17263, Unknown=0, NotChecked=0, Total=19182 [2025-04-30 10:34:35,995 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 265 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:35,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 352 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:34:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-30 10:34:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 215. [2025-04-30 10:34:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 1.187793427230047) internal successors, (253), 214 states have internal predecessors, (253), 0 states have call successors, (0), 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-30 10:34:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2025-04-30 10:34:35,998 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 33 [2025-04-30 10:34:35,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:35,999 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2025-04-30 10:34:35,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 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-30 10:34:35,999 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2025-04-30 10:34:35,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:34:35,999 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:35,999 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:36,006 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-30 10:34:36,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:34:36,204 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:36,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2114789703, now seen corresponding path program 5 times [2025-04-30 10:34:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:36,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956076151] [2025-04-30 10:34:36,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:36,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-30 10:34:36,220 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:34:36,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:36,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:36,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956076151] [2025-04-30 10:34:36,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956076151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:36,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425875790] [2025-04-30 10:34:36,427 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:36,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:36,429 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-30 10:34:36,429 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-30 10:34:36,482 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-30 10:34:36,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:34:36,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:36,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:36,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-30 10:34:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:36,525 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-30 10:34:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:36,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425875790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:37,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2025-04-30 10:34:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958642552] [2025-04-30 10:34:37,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:37,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:34:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:37,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:34:37,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:34:37,027 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 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-30 10:34:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:37,371 INFO L93 Difference]: Finished difference Result 386 states and 423 transitions. [2025-04-30 10:34:37,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:34:37,371 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 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) Word has length 35 [2025-04-30 10:34:37,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:37,372 INFO L225 Difference]: With dead ends: 386 [2025-04-30 10:34:37,372 INFO L226 Difference]: Without dead ends: 386 [2025-04-30 10:34:37,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:34:37,373 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:37,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 562 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-30 10:34:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 215. [2025-04-30 10:34:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 1.1830985915492958) internal successors, (252), 214 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2025-04-30 10:34:37,377 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 35 [2025-04-30 10:34:37,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:37,378 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2025-04-30 10:34:37,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 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-30 10:34:37,378 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2025-04-30 10:34:37,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:34:37,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:37,378 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:37,384 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-30 10:34:37,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:37,582 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:37,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash -205488233, now seen corresponding path program 6 times [2025-04-30 10:34:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:37,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709466538] [2025-04-30 10:34:37,582 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:37,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-04-30 10:34:37,607 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:37,607 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:37,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:37,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:37,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709466538] [2025-04-30 10:34:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709466538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:37,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199031102] [2025-04-30 10:34:37,869 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:37,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:37,870 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-30 10:34:37,872 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-30 10:34:37,937 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-04-30 10:34:37,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:37,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:37,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:37,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:34:37,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:38,043 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-30 10:34:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:38,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:38,116 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-30 10:34:38,120 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-30 10:34:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199031102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:38,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 28 [2025-04-30 10:34:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052927693] [2025-04-30 10:34:38,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:38,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:34:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:38,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:34:38,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:38,160 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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-30 10:34:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:38,373 INFO L93 Difference]: Finished difference Result 413 states and 454 transitions. [2025-04-30 10:34:38,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:34:38,373 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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) Word has length 40 [2025-04-30 10:34:38,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:38,374 INFO L225 Difference]: With dead ends: 413 [2025-04-30 10:34:38,374 INFO L226 Difference]: Without dead ends: 413 [2025-04-30 10:34:38,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:34:38,375 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:38,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 738 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-04-30 10:34:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 240. [2025-04-30 10:34:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 238 states have (on average 1.180672268907563) internal successors, (281), 239 states have internal predecessors, (281), 0 states have call successors, (0), 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-30 10:34:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 281 transitions. [2025-04-30 10:34:38,379 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 281 transitions. Word has length 40 [2025-04-30 10:34:38,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:38,379 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 281 transitions. [2025-04-30 10:34:38,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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-30 10:34:38,380 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 281 transitions. [2025-04-30 10:34:38,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:34:38,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:38,380 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:38,386 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-30 10:34:38,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:38,580 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:38,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1849295309, now seen corresponding path program 7 times [2025-04-30 10:34:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:38,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533766512] [2025-04-30 10:34:38,581 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:38,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:34:38,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:34:38,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:38,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:38,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533766512] [2025-04-30 10:34:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533766512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:38,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764899670] [2025-04-30 10:34:38,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:38,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:38,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:38,898 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-30 10:34:38,899 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-30 10:34:38,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:34:38,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:34:38,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:38,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:38,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:34:38,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:39,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:39,317 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-30 10:34:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764899670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:39,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-04-30 10:34:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215809138] [2025-04-30 10:34:39,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:39,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:34:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:39,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:34:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:34:39,384 INFO L87 Difference]: Start difference. First operand 240 states and 281 transitions. Second operand has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 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-30 10:34:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:39,720 INFO L93 Difference]: Finished difference Result 460 states and 500 transitions. [2025-04-30 10:34:39,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:34:39,720 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-30 10:34:39,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:39,721 INFO L225 Difference]: With dead ends: 460 [2025-04-30 10:34:39,721 INFO L226 Difference]: Without dead ends: 460 [2025-04-30 10:34:39,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:34:39,722 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:39,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 605 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-04-30 10:34:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 240. [2025-04-30 10:34:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 238 states have (on average 1.1764705882352942) internal successors, (280), 239 states have internal predecessors, (280), 0 states have call successors, (0), 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-30 10:34:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2025-04-30 10:34:39,727 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 43 [2025-04-30 10:34:39,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:39,727 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2025-04-30 10:34:39,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 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-30 10:34:39,728 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2025-04-30 10:34:39,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:34:39,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:39,728 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:39,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:34:39,932 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,SelfDestructingSolverStorable31 [2025-04-30 10:34:39,932 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:39,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2006460675, now seen corresponding path program 8 times [2025-04-30 10:34:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:39,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416145494] [2025-04-30 10:34:39,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:39,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:34:39,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:34:39,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:39,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:40,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416145494] [2025-04-30 10:34:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416145494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:40,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770540384] [2025-04-30 10:34:40,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:40,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:40,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:40,233 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-30 10:34:40,234 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-30 10:34:40,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:34:40,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:34:40,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:40,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:40,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:34:40,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:40,353 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-30 10:34:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:40,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:40,399 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-30 10:34:40,400 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-30 10:34:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770540384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:40,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 21 [2025-04-30 10:34:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273041505] [2025-04-30 10:34:40,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:40,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:34:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:40,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:34:40,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:34:40,439 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 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-30 10:34:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:40,631 INFO L93 Difference]: Finished difference Result 492 states and 537 transitions. [2025-04-30 10:34:40,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:34:40,631 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 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) Word has length 48 [2025-04-30 10:34:40,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:40,632 INFO L225 Difference]: With dead ends: 492 [2025-04-30 10:34:40,632 INFO L226 Difference]: Without dead ends: 492 [2025-04-30 10:34:40,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:34:40,633 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:40,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 740 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-30 10:34:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 270. [2025-04-30 10:34:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 268 states have (on average 1.1753731343283582) internal successors, (315), 269 states have internal predecessors, (315), 0 states have call successors, (0), 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-30 10:34:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 315 transitions. [2025-04-30 10:34:40,637 INFO L79 Accepts]: Start accepts. Automaton has 270 states and 315 transitions. Word has length 48 [2025-04-30 10:34:40,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:40,637 INFO L485 AbstractCegarLoop]: Abstraction has 270 states and 315 transitions. [2025-04-30 10:34:40,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 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-30 10:34:40,637 INFO L278 IsEmpty]: Start isEmpty. Operand 270 states and 315 transitions. [2025-04-30 10:34:40,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:34:40,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:40,638 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:40,645 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-30 10:34:40,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:40,838 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:40,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2052671606, now seen corresponding path program 2 times [2025-04-30 10:34:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:40,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585505995] [2025-04-30 10:34:40,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:40,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-30 10:34:40,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:40,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:34:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:41,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585505995] [2025-04-30 10:34:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585505995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:41,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241767881] [2025-04-30 10:34:41,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:41,398 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-30 10:34:41,398 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-30 10:34:41,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-30 10:34:41,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:41,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:41,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:41,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-30 10:34:41,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:41,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:41,494 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-30 10:34:41,496 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-30 10:34:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:34:41,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:34:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241767881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:42,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-04-30 10:34:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35563225] [2025-04-30 10:34:42,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:42,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:34:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:42,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:34:42,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:34:42,669 INFO L87 Difference]: Start difference. First operand 270 states and 315 transitions. Second operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 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-30 10:34:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:46,674 INFO L93 Difference]: Finished difference Result 304 states and 337 transitions. [2025-04-30 10:34:46,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-30 10:34:46,674 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 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 49 [2025-04-30 10:34:46,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:46,675 INFO L225 Difference]: With dead ends: 304 [2025-04-30 10:34:46,675 INFO L226 Difference]: Without dead ends: 304 [2025-04-30 10:34:46,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5188 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1612, Invalid=17848, Unknown=0, NotChecked=0, Total=19460 [2025-04-30 10:34:46,678 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 143 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:46,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 277 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-04-30 10:34:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 238. [2025-04-30 10:34:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 1.1652542372881356) internal successors, (275), 237 states have internal predecessors, (275), 0 states have call successors, (0), 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-30 10:34:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 275 transitions. [2025-04-30 10:34:46,681 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 275 transitions. Word has length 49 [2025-04-30 10:34:46,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:46,681 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 275 transitions. [2025-04-30 10:34:46,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 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-30 10:34:46,682 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 275 transitions. [2025-04-30 10:34:46,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:34:46,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:46,682 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:34:46,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:46,882 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:46,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1876890937, now seen corresponding path program 9 times [2025-04-30 10:34:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:46,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498692688] [2025-04-30 10:34:46,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:46,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-04-30 10:34:46,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:34:46,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:47,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498692688] [2025-04-30 10:34:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498692688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:47,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838735224] [2025-04-30 10:34:47,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:47,285 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-30 10:34:47,286 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-30 10:34:47,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-04-30 10:34:47,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:34:47,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:47,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:34:47,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:47,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:47,767 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-30 10:34:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:47,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838735224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:47,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2025-04-30 10:34:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395769250] [2025-04-30 10:34:47,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:47,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:34:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:47,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:34:47,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:47,841 INFO L87 Difference]: Start difference. First operand 238 states and 275 transitions. Second operand has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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-30 10:34:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:48,240 INFO L93 Difference]: Finished difference Result 499 states and 535 transitions. [2025-04-30 10:34:48,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:34:48,241 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-30 10:34:48,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:48,242 INFO L225 Difference]: With dead ends: 499 [2025-04-30 10:34:48,242 INFO L226 Difference]: Without dead ends: 499 [2025-04-30 10:34:48,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:34:48,242 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 122 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:48,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 390 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-04-30 10:34:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 238. [2025-04-30 10:34:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 1.1610169491525424) internal successors, (274), 237 states have internal predecessors, (274), 0 states have call successors, (0), 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-30 10:34:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 274 transitions. [2025-04-30 10:34:48,246 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 274 transitions. Word has length 51 [2025-04-30 10:34:48,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:48,246 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 274 transitions. [2025-04-30 10:34:48,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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-30 10:34:48,246 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 274 transitions. [2025-04-30 10:34:48,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:34:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:48,247 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:48,253 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-30 10:34:48,447 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,SelfDestructingSolverStorable34 [2025-04-30 10:34:48,447 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:48,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -646817513, now seen corresponding path program 10 times [2025-04-30 10:34:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:48,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271314466] [2025-04-30 10:34:48,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:48,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-30 10:34:48,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:34:48,478 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:48,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:48,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271314466] [2025-04-30 10:34:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271314466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:48,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974918526] [2025-04-30 10:34:48,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:48,892 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-30 10:34:48,893 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-30 10:34:48,956 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-30 10:34:49,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:34:49,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:49,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:34:49,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:49,164 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-30 10:34:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:49,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:49,270 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-30 10:34:49,272 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-30 10:34:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974918526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:49,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 34 [2025-04-30 10:34:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90067007] [2025-04-30 10:34:49,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:49,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:34:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:49,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:34:49,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:34:49,325 INFO L87 Difference]: Start difference. First operand 238 states and 274 transitions. Second operand has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:49,691 INFO L93 Difference]: Finished difference Result 536 states and 578 transitions. [2025-04-30 10:34:49,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:34:49,691 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-30 10:34:49,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:49,692 INFO L225 Difference]: With dead ends: 536 [2025-04-30 10:34:49,692 INFO L226 Difference]: Without dead ends: 536 [2025-04-30 10:34:49,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:49,693 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:49,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1463 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-04-30 10:34:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 273. [2025-04-30 10:34:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 271 states have (on average 1.1623616236162362) internal successors, (315), 272 states have internal predecessors, (315), 0 states have call successors, (0), 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-30 10:34:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2025-04-30 10:34:49,697 INFO L79 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 56 [2025-04-30 10:34:49,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:49,697 INFO L485 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2025-04-30 10:34:49,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:49,697 INFO L278 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2025-04-30 10:34:49,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:34:49,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:49,697 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:49,704 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-30 10:34:49,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:49,898 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:49,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2005094579, now seen corresponding path program 11 times [2025-04-30 10:34:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:49,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369038250] [2025-04-30 10:34:49,898 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:49,905 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-04-30 10:34:49,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:34:49,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:34:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:50,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369038250] [2025-04-30 10:34:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369038250] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:50,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423508489] [2025-04-30 10:34:50,274 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:50,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:50,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:50,276 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-30 10:34:50,276 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-30 10:34:50,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-04-30 10:34:50,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:34:50,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:34:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:50,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-30 10:34:50,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:50,484 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-30 10:34:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:50,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423508489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:51,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 47 [2025-04-30 10:34:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274352062] [2025-04-30 10:34:51,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:51,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:34:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:51,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:34:51,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2018, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:34:51,154 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 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-30 10:34:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:51,756 INFO L93 Difference]: Finished difference Result 571 states and 612 transitions. [2025-04-30 10:34:51,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:34:51,756 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 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 59 [2025-04-30 10:34:51,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:51,757 INFO L225 Difference]: With dead ends: 571 [2025-04-30 10:34:51,757 INFO L226 Difference]: Without dead ends: 571 [2025-04-30 10:34:51,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=2662, Unknown=0, NotChecked=0, Total=2970 [2025-04-30 10:34:51,758 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:51,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1290 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:34:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-04-30 10:34:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 273. [2025-04-30 10:34:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 271 states have (on average 1.1586715867158672) internal successors, (314), 272 states have internal predecessors, (314), 0 states have call successors, (0), 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-30 10:34:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 314 transitions. [2025-04-30 10:34:51,761 INFO L79 Accepts]: Start accepts. Automaton has 273 states and 314 transitions. Word has length 59 [2025-04-30 10:34:51,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:51,762 INFO L485 AbstractCegarLoop]: Abstraction has 273 states and 314 transitions. [2025-04-30 10:34:51,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 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-30 10:34:51,762 INFO L278 IsEmpty]: Start isEmpty. Operand 273 states and 314 transitions. [2025-04-30 10:34:51,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:34:51,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:51,762 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:51,769 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-30 10:34:51,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:51,963 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:51,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2023363709, now seen corresponding path program 12 times [2025-04-30 10:34:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:51,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468357389] [2025-04-30 10:34:51,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:51,970 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-04-30 10:34:51,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:34:51,998 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:34:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:52,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468357389] [2025-04-30 10:34:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468357389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:52,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497583525] [2025-04-30 10:34:52,429 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:52,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:52,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:52,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:34:52,500 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-04-30 10:34:52,797 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:34:52,797 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:34:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:52,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-04-30 10:34:52,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:52,949 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-30 10:34:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:53,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:53,069 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-30 10:34:53,070 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-30 10:34:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497583525] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:53,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 38 [2025-04-30 10:34:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923204458] [2025-04-30 10:34:53,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:53,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-30 10:34:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:53,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-30 10:34:53,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:34:53,138 INFO L87 Difference]: Start difference. First operand 273 states and 314 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 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-30 10:34:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:53,580 INFO L93 Difference]: Finished difference Result 613 states and 661 transitions. [2025-04-30 10:34:53,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:53,580 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 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-30 10:34:53,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:53,581 INFO L225 Difference]: With dead ends: 613 [2025-04-30 10:34:53,581 INFO L226 Difference]: Without dead ends: 613 [2025-04-30 10:34:53,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:34:53,582 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:53,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1941 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-30 10:34:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 313. [2025-04-30 10:34:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 311 states have (on average 1.1607717041800643) internal successors, (361), 312 states have internal predecessors, (361), 0 states have call successors, (0), 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-30 10:34:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 361 transitions. [2025-04-30 10:34:53,586 INFO L79 Accepts]: Start accepts. Automaton has 313 states and 361 transitions. Word has length 64 [2025-04-30 10:34:53,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:53,586 INFO L485 AbstractCegarLoop]: Abstraction has 313 states and 361 transitions. [2025-04-30 10:34:53,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 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-30 10:34:53,586 INFO L278 IsEmpty]: Start isEmpty. Operand 313 states and 361 transitions. [2025-04-30 10:34:53,587 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-30 10:34:53,587 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:53,587 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:53,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:34:53,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:53,788 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:53,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -802575431, now seen corresponding path program 13 times [2025-04-30 10:34:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:53,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723245526] [2025-04-30 10:34:53,788 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:53,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:34:53,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:34:53,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:53,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 35 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:54,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723245526] [2025-04-30 10:34:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723245526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:54,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220688958] [2025-04-30 10:34:54,288 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:54,289 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:54,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:34:54,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:34:54,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:34:54,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:54,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:54,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-30 10:34:54,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:54,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:54,921 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-30 10:34:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220688958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:55,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 45 [2025-04-30 10:34:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202558294] [2025-04-30 10:34:55,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:55,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:34:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:34:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1858, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:34:55,025 INFO L87 Difference]: Start difference. First operand 313 states and 361 transitions. Second operand has 46 states, 45 states have (on average 3.0) internal successors, (135), 46 states have internal predecessors, (135), 0 states have call successors, (0), 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-30 10:34:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:55,607 INFO L93 Difference]: Finished difference Result 644 states and 691 transitions. [2025-04-30 10:34:55,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:34:55,608 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.0) internal successors, (135), 46 states have internal predecessors, (135), 0 states have call successors, (0), 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-30 10:34:55,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:55,609 INFO L225 Difference]: With dead ends: 644 [2025-04-30 10:34:55,609 INFO L226 Difference]: Without dead ends: 644 [2025-04-30 10:34:55,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=2574, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:55,610 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:55,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1124 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-04-30 10:34:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 313. [2025-04-30 10:34:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 311 states have (on average 1.157556270096463) internal successors, (360), 312 states have internal predecessors, (360), 0 states have call successors, (0), 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-30 10:34:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 360 transitions. [2025-04-30 10:34:55,616 INFO L79 Accepts]: Start accepts. Automaton has 313 states and 360 transitions. Word has length 67 [2025-04-30 10:34:55,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:55,616 INFO L485 AbstractCegarLoop]: Abstraction has 313 states and 360 transitions. [2025-04-30 10:34:55,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.0) internal successors, (135), 46 states have internal predecessors, (135), 0 states have call successors, (0), 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-30 10:34:55,616 INFO L278 IsEmpty]: Start isEmpty. Operand 313 states and 360 transitions. [2025-04-30 10:34:55,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-04-30 10:34:55,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:55,617 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:55,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-30 10:34:55,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-30 10:34:55,817 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:55,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -389950825, now seen corresponding path program 14 times [2025-04-30 10:34:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:55,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306542530] [2025-04-30 10:34:55,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:55,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:34:55,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:34:55,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:55,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:56,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306542530] [2025-04-30 10:34:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306542530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:56,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855259201] [2025-04-30 10:34:56,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:56,353 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:56,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:34:56,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:34:56,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:34:56,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:56,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-30 10:34:56,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:56,625 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-30 10:34:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:56,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:56,753 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-30 10:34:56,756 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-30 10:34:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855259201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:56,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-04-30 10:34:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962340953] [2025-04-30 10:34:56,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:56,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:34:56,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:34:56,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:56,823 INFO L87 Difference]: Start difference. First operand 313 states and 360 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-30 10:34:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:57,317 INFO L93 Difference]: Finished difference Result 691 states and 746 transitions. [2025-04-30 10:34:57,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:34:57,317 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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 72 [2025-04-30 10:34:57,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:57,318 INFO L225 Difference]: With dead ends: 691 [2025-04-30 10:34:57,318 INFO L226 Difference]: Without dead ends: 691 [2025-04-30 10:34:57,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:34:57,319 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 53 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:57,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2070 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-04-30 10:34:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 358. [2025-04-30 10:34:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 356 states have (on average 1.1601123595505618) internal successors, (413), 357 states have internal predecessors, (413), 0 states have call successors, (0), 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-30 10:34:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 413 transitions. [2025-04-30 10:34:57,326 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 413 transitions. Word has length 72 [2025-04-30 10:34:57,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:57,327 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 413 transitions. [2025-04-30 10:34:57,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-30 10:34:57,327 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 413 transitions. [2025-04-30 10:34:57,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-30 10:34:57,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:57,327 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:57,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:57,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-30 10:34:57,528 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:34:57,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 82901612, now seen corresponding path program 3 times [2025-04-30 10:34:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:57,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562037080] [2025-04-30 10:34:57,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:57,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 15 equivalence classes. [2025-04-30 10:34:57,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 73 of 73 statements. [2025-04-30 10:34:57,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-30 10:34:57,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 42 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-04-30 10:34:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:58,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562037080] [2025-04-30 10:34:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562037080] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:58,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569427030] [2025-04-30 10:34:58,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:58,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:58,368 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:58,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-30 10:34:58,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 15 equivalence classes. [2025-04-30 10:34:58,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 73 of 73 statements. [2025-04-30 10:34:58,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-30 10:34:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:58,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-04-30 10:34:58,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:58,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:58,711 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-30 10:34:58,712 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-30 10:34:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:59,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569427030] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:02,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 37, 37] total 87 [2025-04-30 10:35:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752203165] [2025-04-30 10:35:02,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:02,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-30 10:35:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-30 10:35:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=6901, Unknown=0, NotChecked=0, Total=7656 [2025-04-30 10:35:02,146 INFO L87 Difference]: Start difference. First operand 358 states and 413 transitions. Second operand has 88 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 88 states have internal predecessors, (166), 0 states have call successors, (0), 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-30 10:35:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:08,266 INFO L93 Difference]: Finished difference Result 471 states and 524 transitions. [2025-04-30 10:35:08,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-04-30 10:35:08,267 INFO L79 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 88 states have internal predecessors, (166), 0 states have call successors, (0), 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 73 [2025-04-30 10:35:08,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:08,267 INFO L225 Difference]: With dead ends: 471 [2025-04-30 10:35:08,267 INFO L226 Difference]: Without dead ends: 116 [2025-04-30 10:35:08,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6987 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3170, Invalid=34660, Unknown=0, NotChecked=0, Total=37830 [2025-04-30 10:35:08,269 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 432 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 5560 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 5798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 5560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:08,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1475 Invalid, 5798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 5560 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-30 10:35:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-30 10:35:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2025-04-30 10:35:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 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-30 10:35:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2025-04-30 10:35:08,272 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2025-04-30 10:35:08,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:08,272 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2025-04-30 10:35:08,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 88 states have internal predecessors, (166), 0 states have call successors, (0), 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-30 10:35:08,272 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2025-04-30 10:35:08,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-30 10:35:08,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:08,272 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:08,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-30 10:35:08,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:08,474 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:35:08,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1479867597, now seen corresponding path program 15 times [2025-04-30 10:35:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:08,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135409743] [2025-04-30 10:35:08,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:08,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 9 equivalence classes. [2025-04-30 10:35:08,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 75 of 75 statements. [2025-04-30 10:35:08,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-30 10:35:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 51 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:09,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135409743] [2025-04-30 10:35:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135409743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:09,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594279812] [2025-04-30 10:35:09,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:09,219 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:09,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-30 10:35:09,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 9 equivalence classes. [2025-04-30 10:35:09,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 75 of 75 statements. [2025-04-30 10:35:09,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-30 10:35:09,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:09,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-30 10:35:09,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:09,862 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-30 10:35:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:10,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594279812] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:10,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 62 [2025-04-30 10:35:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054426732] [2025-04-30 10:35:10,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:10,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-30 10:35:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:10,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-30 10:35:10,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3434, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:35:10,661 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 63 states, 62 states have (on average 2.9838709677419355) internal successors, (185), 63 states have internal predecessors, (185), 0 states have call successors, (0), 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-30 10:35:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:11,214 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2025-04-30 10:35:11,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:35:11,215 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.9838709677419355) internal successors, (185), 63 states have internal predecessors, (185), 0 states have call successors, (0), 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-30 10:35:11,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:11,215 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:35:11,215 INFO L226 Difference]: Without dead ends: 81 [2025-04-30 10:35:11,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=805, Invalid=5357, Unknown=0, NotChecked=0, Total=6162 [2025-04-30 10:35:11,216 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:11,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:35:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-30 10:35:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-04-30 10:35:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-04-30 10:35:11,217 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2025-04-30 10:35:11,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:11,218 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-04-30 10:35:11,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.9838709677419355) internal successors, (185), 63 states have internal predecessors, (185), 0 states have call successors, (0), 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-30 10:35:11,218 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-04-30 10:35:11,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:35:11,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:11,218 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:11,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-30 10:35:11,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:11,419 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:35:11,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash 172101123, now seen corresponding path program 16 times [2025-04-30 10:35:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:11,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313206662] [2025-04-30 10:35:11,419 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:35:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:11,428 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-04-30 10:35:11,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:35:11,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:35:11,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:12,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313206662] [2025-04-30 10:35:12,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313206662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:12,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459749793] [2025-04-30 10:35:12,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:35:12,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:12,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:12,063 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:12,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-30 10:35:12,161 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. Killed by 15