./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81082bc27f1a4e6a6ab0540cbf91dcecc4225dd82e3e99dced7c54afca261771 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:56,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:56,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:16:56,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:56,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:56,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:56,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:56,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:56,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:56,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:56,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:56,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:56,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:56,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:56,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:56,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:56,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:56,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:56,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:56,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:56,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:16:56,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:16:56,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:56,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:56,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:56,798 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 -> 81082bc27f1a4e6a6ab0540cbf91dcecc4225dd82e3e99dced7c54afca261771 [2025-04-29 11:16:57,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:57,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:57,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:57,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:57,038 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:57,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1.c [2025-04-29 11:16:58,336 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6462ba7/bbc1840ee00d44b6915d3fed2dfcd571/FLAG444c0012d [2025-04-29 11:16:58,531 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:58,531 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_1.c [2025-04-29 11:16:58,534 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:58,534 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:58,545 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6462ba7/bbc1840ee00d44b6915d3fed2dfcd571/FLAG444c0012d [2025-04-29 11:16:59,338 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6462ba7/bbc1840ee00d44b6915d3fed2dfcd571 [2025-04-29 11:16:59,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:59,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:59,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:59,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:59,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:59,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2c51b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59, skipping insertion in model container [2025-04-29 11:16:59,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:59,525 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:59,535 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:59,567 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:59,579 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:59,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59 WrapperNode [2025-04-29 11:16:59,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:59,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:59,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:59,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:59,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,610 INFO L138 Inliner]: procedures = 13, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2025-04-29 11:16:59,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:59,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:59,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:59,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:59,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,635 INFO L175 MemorySlicer]: Split 15 memory accesses to 1 slices as follows [15]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2025-04-29 11:16:59,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:59,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:59,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:59,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:59,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (1/1) ... [2025-04-29 11:16:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:59,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:16:59,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 11:16:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:16:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:16:59,757 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:59,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:59,782 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 11:17:00,074 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-04-29 11:17:00,075 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:17:00,082 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:17:00,083 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-04-29 11:17:00,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:17:00 BoogieIcfgContainer [2025-04-29 11:17:00,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:17:00,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:17:00,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:17:00,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:17:00,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:59" (1/3) ... [2025-04-29 11:17:00,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0c437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:17:00, skipping insertion in model container [2025-04-29 11:17:00,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:59" (2/3) ... [2025-04-29 11:17:00,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0c437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:17:00, skipping insertion in model container [2025-04-29 11:17:00,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:17:00" (3/3) ... [2025-04-29 11:17:00,090 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext_1.c [2025-04-29 11:17:00,100 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:17:00,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext_1.c that has 2 procedures, 98 locations, 118 edges, 1 initial locations, 5 loop locations, and 37 error locations. [2025-04-29 11:17:00,132 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:17:00,140 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;@42102595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:17:00,140 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-29 11:17:00,143 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 95 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:17:00,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,148 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:00,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2098270962, now seen corresponding path program 1 times [2025-04-29 11:17:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367641330] [2025-04-29 11:17:00,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:17:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:17:00,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:00,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:00,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367641330] [2025-04-29 11:17:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367641330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:00,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898879516] [2025-04-29 11:17:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:17:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:17:00,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:17:00,275 INFO L87 Difference]: Start difference. First operand has 97 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 95 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:00,296 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2025-04-29 11:17:00,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:17:00,297 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:17:00,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:00,300 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:17:00,301 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:17:00,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:17:00,306 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:00,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:17:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:17:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 87 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-29 11:17:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-04-29 11:17:00,340 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 7 [2025-04-29 11:17:00,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:00,340 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-04-29 11:17:00,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,341 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-04-29 11:17:00,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:17:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:17:00,341 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:00,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199990, now seen corresponding path program 1 times [2025-04-29 11:17:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903671619] [2025-04-29 11:17:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:17:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:17:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:00,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903671619] [2025-04-29 11:17:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903671619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:00,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:00,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473198243] [2025-04-29 11:17:00,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:00,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:00,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:00,469 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:00,639 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2025-04-29 11:17:00,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:00,639 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:17:00,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:00,641 INFO L225 Difference]: With dead ends: 91 [2025-04-29 11:17:00,641 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:17:00,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:00,641 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:00,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 56 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:17:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-29 11:17:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.646153846153846) internal successors, (107), 90 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-29 11:17:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2025-04-29 11:17:00,648 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 9 [2025-04-29 11:17:00,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:00,649 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2025-04-29 11:17:00,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,649 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2025-04-29 11:17:00,649 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:17:00,649 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:17:00,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:00,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199991, now seen corresponding path program 1 times [2025-04-29 11:17:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584981344] [2025-04-29 11:17:00,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:17:00,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:17:00,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:00,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584981344] [2025-04-29 11:17:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584981344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941535788] [2025-04-29 11:17:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:00,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:00,803 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:00,947 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-04-29 11:17:00,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:00,947 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:17:00,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:00,948 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:17:00,948 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:17:00,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:00,949 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:00,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 87 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:17:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-29 11:17:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 112 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2025-04-29 11:17:00,954 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 9 [2025-04-29 11:17:00,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:00,954 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2025-04-29 11:17:00,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,955 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2025-04-29 11:17:00,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:00,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:17:00,955 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:00,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137561, now seen corresponding path program 1 times [2025-04-29 11:17:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645497670] [2025-04-29 11:17:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:00,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:00,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645497670] [2025-04-29 11:17:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645497670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829710061] [2025-04-29 11:17:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:01,137 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,314 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2025-04-29 11:17:01,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:01,315 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:17:01,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,316 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:17:01,316 INFO L226 Difference]: Without dead ends: 118 [2025-04-29 11:17:01,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:01,318 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 32 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:01,318 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 201 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-29 11:17:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-04-29 11:17:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 117 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2025-04-29 11:17:01,328 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 19 [2025-04-29 11:17:01,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,328 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2025-04-29 11:17:01,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,328 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2025-04-29 11:17:01,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:01,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:01,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:17:01,331 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:01,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137560, now seen corresponding path program 1 times [2025-04-29 11:17:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344236709] [2025-04-29 11:17:01,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:01,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344236709] [2025-04-29 11:17:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344236709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325870407] [2025-04-29 11:17:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:01,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:01,527 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,707 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-04-29 11:17:01,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:01,707 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:17:01,707 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,708 INFO L225 Difference]: With dead ends: 120 [2025-04-29 11:17:01,708 INFO L226 Difference]: Without dead ends: 120 [2025-04-29 11:17:01,708 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:01,709 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:01,709 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 257 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-29 11:17:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2025-04-29 11:17:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.435897435897436) internal successors, (112), 99 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-04-29 11:17:01,717 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 19 [2025-04-29 11:17:01,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,717 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-04-29 11:17:01,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,717 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-04-29 11:17:01,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:01,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:17:01,718 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:01,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 691891406, now seen corresponding path program 1 times [2025-04-29 11:17:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414143937] [2025-04-29 11:17:01,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414143937] [2025-04-29 11:17:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414143937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983582529] [2025-04-29 11:17:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:01,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:01,862 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,018 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2025-04-29 11:17:02,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:02,019 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:17:02,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,020 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:17:02,020 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:17:02,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:17:02,021 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 82 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 248 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:17:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 111. [2025-04-29 11:17:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 110 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2025-04-29 11:17:02,025 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 19 [2025-04-29 11:17:02,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,025 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2025-04-29 11:17:02,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,026 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2025-04-29 11:17:02,026 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:17:02,026 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:17:02,026 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:02,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -509806655, now seen corresponding path program 1 times [2025-04-29 11:17:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627412089] [2025-04-29 11:17:02,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:17:02,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:17:02,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627412089] [2025-04-29 11:17:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627412089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236029400] [2025-04-29 11:17:02,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:02,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:02,115 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,234 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2025-04-29 11:17:02,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:02,235 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-29 11:17:02,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,235 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:17:02,235 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:17:02,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:02,236 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 178 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:17:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-29 11:17:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.404494382022472) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2025-04-29 11:17:02,239 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 21 [2025-04-29 11:17:02,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,239 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2025-04-29 11:17:02,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,239 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2025-04-29 11:17:02,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:17:02,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:17:02,240 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:02,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -509806654, now seen corresponding path program 1 times [2025-04-29 11:17:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877872306] [2025-04-29 11:17:02,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:17:02,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:17:02,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877872306] [2025-04-29 11:17:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877872306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448224671] [2025-04-29 11:17:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:02,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:02,411 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,545 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2025-04-29 11:17:02,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:02,545 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-29 11:17:02,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,546 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:17:02,546 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:17:02,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:02,548 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 224 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:17:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-04-29 11:17:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 92 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-29 11:17:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2025-04-29 11:17:02,556 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 21 [2025-04-29 11:17:02,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,556 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-04-29 11:17:02,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,556 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2025-04-29 11:17:02,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:17:02,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:17:02,557 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:02,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1262416469, now seen corresponding path program 1 times [2025-04-29 11:17:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005410600] [2025-04-29 11:17:02,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:17:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:17:02,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005410600] [2025-04-29 11:17:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005410600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905392439] [2025-04-29 11:17:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:02,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:02,661 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,776 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2025-04-29 11:17:02,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:02,776 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-29 11:17:02,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,777 INFO L225 Difference]: With dead ends: 132 [2025-04-29 11:17:02,777 INFO L226 Difference]: Without dead ends: 132 [2025-04-29 11:17:02,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:17:02,777 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 243 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-29 11:17:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2025-04-29 11:17:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3625) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-04-29 11:17:02,780 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 21 [2025-04-29 11:17:02,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,780 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-04-29 11:17:02,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,781 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-04-29 11:17:02,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:17:02,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:17:02,781 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:02,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 148300497, now seen corresponding path program 1 times [2025-04-29 11:17:02,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154685454] [2025-04-29 11:17:02,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:02,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:02,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154685454] [2025-04-29 11:17:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154685454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348249925] [2025-04-29 11:17:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:02,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:02,836 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,905 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2025-04-29 11:17:02,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:02,906 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-29 11:17:02,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,907 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:17:02,907 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:17:02,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:02,907 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 90 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 87 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:17:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2025-04-29 11:17:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.353658536585366) internal successors, (111), 96 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-29 11:17:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-04-29 11:17:02,910 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 24 [2025-04-29 11:17:02,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,910 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-04-29 11:17:02,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,910 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-04-29 11:17:02,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:17:02,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:17:02,911 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:02,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 782863604, now seen corresponding path program 1 times [2025-04-29 11:17:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691102173] [2025-04-29 11:17:02,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:17:02,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:17:02,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691102173] [2025-04-29 11:17:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691102173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988453161] [2025-04-29 11:17:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:02,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:02,980 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,069 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-04-29 11:17:03,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:17:03,069 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:17:03,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,070 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:17:03,070 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:17:03,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:03,070 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 48 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 176 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:17:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2025-04-29 11:17:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 101 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-04-29 11:17:03,073 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 26 [2025-04-29 11:17:03,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,073 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-04-29 11:17:03,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,073 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-04-29 11:17:03,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:17:03,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:17:03,074 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:03,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1475568894, now seen corresponding path program 1 times [2025-04-29 11:17:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368074739] [2025-04-29 11:17:03,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:17:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:17:03,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368074739] [2025-04-29 11:17:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368074739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841156898] [2025-04-29 11:17:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:03,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:03,303 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,439 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2025-04-29 11:17:03,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:03,440 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:17:03,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,441 INFO L225 Difference]: With dead ends: 114 [2025-04-29 11:17:03,441 INFO L226 Difference]: Without dead ends: 102 [2025-04-29 11:17:03,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:17:03,441 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 215 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-29 11:17:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-04-29 11:17:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-04-29 11:17:03,446 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 28 [2025-04-29 11:17:03,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,446 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-04-29 11:17:03,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,446 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-04-29 11:17:03,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:03,448 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:17:03,449 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:03,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash -202037761, now seen corresponding path program 1 times [2025-04-29 11:17:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079341470] [2025-04-29 11:17:03,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:03,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:03,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,821 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-29 11:17:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079341470] [2025-04-29 11:17:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079341470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:03,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747793798] [2025-04-29 11:17:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:03,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:03,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:17:03,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:03,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:03,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:17:03,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:04,019 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:17:04,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:17:04,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:17:04,236 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:04,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-04-29 11:17:04,260 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:04,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-29 11:17:04,336 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 31 treesize of output 13 [2025-04-29 11:17:04,408 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-29 11:17:04,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:04,511 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-04-29 11:17:04,519 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-04-29 11:17:04,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:04,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:17:04,535 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:04,535 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-04-29 11:17:04,552 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 9 treesize of output 5 [2025-04-29 11:17:05,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:05,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748 [2025-04-29 11:17:29,805 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-29 11:17:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747793798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:29,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-04-29 11:17:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962158732] [2025-04-29 11:17:29,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:29,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:17:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:17:29,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=694, Unknown=11, NotChecked=110, Total=930 [2025-04-29 11:17:29,807 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:30,508 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2025-04-29 11:17:30,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:17:30,508 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:17:30,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:30,509 INFO L225 Difference]: With dead ends: 182 [2025-04-29 11:17:30,509 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 11:17:30,509 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=1256, Unknown=11, NotChecked=150, Total=1640 [2025-04-29 11:17:30,510 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 424 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:30,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 617 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 828 Invalid, 0 Unknown, 399 Unchecked, 0.5s Time] [2025-04-29 11:17:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 11:17:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 112. [2025-04-29 11:17:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 111 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2025-04-29 11:17:30,512 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 29 [2025-04-29 11:17:30,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:30,512 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2025-04-29 11:17:30,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:30,513 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2025-04-29 11:17:30,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:30,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:30,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:30,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:17:30,714 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,SelfDestructingSolverStorable12 [2025-04-29 11:17:30,715 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:30,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash -202037760, now seen corresponding path program 1 times [2025-04-29 11:17:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:30,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067405291] [2025-04-29 11:17:30,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:30,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:30,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,051 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-29 11:17:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067405291] [2025-04-29 11:17:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067405291] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:31,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948795778] [2025-04-29 11:17:31,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:31,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:17:31,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:31,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:31,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:17:31,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:31,158 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:31,159 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:17:31,165 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-29 11:17:31,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:17:31,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:17:31,302 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:31,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-04-29 11:17:31,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:31,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:17:31,331 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:31,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:17:31,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:17:31,395 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 31 treesize of output 13 [2025-04-29 11:17:31,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:17:31,434 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-29 11:17:31,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:31,642 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_265 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2025-04-29 11:17:31,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,649 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-29 11:17:31,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:17:31,662 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2025-04-29 11:17:31,673 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2025-04-29 11:17:31,694 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 15 treesize of output 11 [2025-04-29 11:17:31,697 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 11 treesize of output 7 [2025-04-29 11:17:31,702 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,702 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 11:17:31,704 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:17:31,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:31,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:17:31,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:31,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-04-29 11:17:31,843 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-29 11:17:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948795778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:31,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-04-29 11:17:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016443503] [2025-04-29 11:17:31,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:31,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:17:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:31,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:17:31,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=782, Unknown=34, NotChecked=58, Total=992 [2025-04-29 11:17:31,845 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:32,702 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2025-04-29 11:17:32,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:17:32,703 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2025-04-29 11:17:32,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:32,703 INFO L225 Difference]: With dead ends: 181 [2025-04-29 11:17:32,703 INFO L226 Difference]: Without dead ends: 181 [2025-04-29 11:17:32,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1739, Unknown=38, NotChecked=88, Total=2162 [2025-04-29 11:17:32,705 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 445 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:32,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 824 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 930 Invalid, 0 Unknown, 193 Unchecked, 0.5s Time] [2025-04-29 11:17:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-29 11:17:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2025-04-29 11:17:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2025-04-29 11:17:32,710 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 29 [2025-04-29 11:17:32,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:32,710 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2025-04-29 11:17:32,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:32,711 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2025-04-29 11:17:32,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:32,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:32,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:32,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:17:32,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:17:32,912 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-04-29 11:17:32,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1571354851, now seen corresponding path program 1 times [2025-04-29 11:17:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:32,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254547265] [2025-04-29 11:17:32,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:32,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:32,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:32,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:32,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:33,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254547265] [2025-04-29 11:17:33,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254547265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:33,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402988769] [2025-04-29 11:17:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:33,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:33,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:33,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:17:33,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:33,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:33,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:33,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:33,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:17:33,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:33,233 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:17:33,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:17:33,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:17:33,351 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:33,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-04-29 11:17:33,365 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:33,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-29 11:17:33,417 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 31 treesize of output 13 [2025-04-29 11:17:33,456 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-29 11:17:33,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:33,534 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-04-29 11:17:33,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:33,561 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:17:33,566 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:33,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-04-29 11:17:33,568 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 9 treesize of output 5 [2025-04-29 11:17:34,131 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:34,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748 Killed by 15