./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d43998749357adc0c7ecc28879f8e9e6080b5b3c4120ebffe9ca1563e04a5c7b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:57,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:57,751 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:57,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:57,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:57,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:57,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:57,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:57,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:57,769 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:57,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:57,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:57,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:57,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:57,770 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:57,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:57,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:57,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:57,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:16:57,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:16:57,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:57,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:57,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:57,773 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 -> d43998749357adc0c7ecc28879f8e9e6080b5b3c4120ebffe9ca1563e04a5c7b [2025-04-29 11:16:57,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:57,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:57,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:57,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:57,987 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:57,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_2.c [2025-04-29 11:16:59,218 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2b8c9ef/27a0cac7ab0f46a6bbd4f7af7902fa6d/FLAG6057dc557 [2025-04-29 11:16:59,460 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:59,461 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_2.c [2025-04-29 11:16:59,463 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:59,463 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:59,470 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2b8c9ef/27a0cac7ab0f46a6bbd4f7af7902fa6d/FLAG6057dc557 [2025-04-29 11:17:00,218 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2b8c9ef/27a0cac7ab0f46a6bbd4f7af7902fa6d [2025-04-29 11:17:00,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:17:00,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:17:00,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:17:00,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:17:00,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:17:00,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f9989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00, skipping insertion in model container [2025-04-29 11:17:00,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:17:00,407 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:17:00,417 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:17:00,445 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:17:00,455 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:17:00,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00 WrapperNode [2025-04-29 11:17:00,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:17:00,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:17:00,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:17:00,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:17:00,462 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:17:00" (1/1) ... [2025-04-29 11:17:00,471 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:17:00" (1/1) ... [2025-04-29 11:17:00,487 INFO L138 Inliner]: procedures = 14, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-04-29 11:17:00,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:17:00,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:17:00,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:17:00,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:17:00,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,509 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:17:00,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:17:00,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:17:00,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:17:00,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:17:00,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (1/1) ... [2025-04-29 11:17:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:17:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:00,548 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:17:00,551 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:17:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:17:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:17:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:17:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:17:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 11:17:00,568 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 11:17:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:17:00,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:17:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:17:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:17:00,620 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:17:00,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:17:00,644 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 11:17:00,878 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-04-29 11:17:00,879 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:17:00,889 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:17:00,889 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-04-29 11:17:00,889 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,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:17:00,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:17:00,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:17:00,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:17:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:17:00" (1/3) ... [2025-04-29 11:17:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a658f1 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,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:00" (2/3) ... [2025-04-29 11:17:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a658f1 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,895 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,896 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext_2.c [2025-04-29 11:17:00,908 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:17:00,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext_2.c that has 2 procedures, 99 locations, 119 edges, 1 initial locations, 5 loop locations, and 37 error locations. [2025-04-29 11:17:00,944 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:17:00,953 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;@56995054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:17:00,953 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-29 11:17:00,957 INFO L278 IsEmpty]: Start isEmpty. Operand has 98 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 96 states have internal predecessors, (110), 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,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:17:00,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,962 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,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2098270962, now seen corresponding path program 1 times [2025-04-29 11:17:00,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675042372] [2025-04-29 11:17:00,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:17:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:17:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,063 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:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675042372] [2025-04-29 11:17:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675042372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367511516] [2025-04-29 11:17:01,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:17:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:17:01,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:17:01,088 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 96 states have internal predecessors, (110), 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:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,101 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2025-04-29 11:17:01,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:17:01,102 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:01,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,105 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:17:01,106 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:17:01,107 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:01,109 INFO L437 NwaCegarLoop]: 106 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, 106 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:01,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 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:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:17:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-29 11:17:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 88 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2025-04-29 11:17:01,136 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 7 [2025-04-29 11:17:01,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,136 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2025-04-29 11:17:01,137 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:01,137 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2025-04-29 11:17:01,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:17:01,137 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:01,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:17:01,137 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:01,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199990, now seen corresponding path program 1 times [2025-04-29 11:17:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301475253] [2025-04-29 11:17:01,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:17:01,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:17:01,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301475253] [2025-04-29 11:17:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301475253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582321726] [2025-04-29 11:17:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:01,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:01,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:01,244 INFO L87 Difference]: Start difference. First operand 89 states and 95 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:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,382 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2025-04-29 11:17:01,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:01,383 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:01,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,384 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:17:01,384 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:17:01,384 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:01,384 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 116 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 57 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:01,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 57 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:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:17:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:17:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 91 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2025-04-29 11:17:01,389 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 9 [2025-04-29 11:17:01,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,390 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2025-04-29 11:17:01,390 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:01,390 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2025-04-29 11:17:01,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:17:01,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:01,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:17:01,390 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:01,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199991, now seen corresponding path program 1 times [2025-04-29 11:17:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832287961] [2025-04-29 11:17:01,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:17:01,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:17:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,517 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:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832287961] [2025-04-29 11:17:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832287961] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101901217] [2025-04-29 11:17:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:01,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:01,520 INFO L87 Difference]: Start difference. First operand 92 states and 108 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:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,642 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2025-04-29 11:17:01,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:01,643 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:01,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,643 INFO L225 Difference]: With dead ends: 115 [2025-04-29 11:17:01,644 INFO L226 Difference]: Without dead ends: 115 [2025-04-29 11:17:01,644 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:01,644 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 122 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 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:01,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 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:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-29 11:17:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-04-29 11:17:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.449438202247191) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2025-04-29 11:17:01,649 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 9 [2025-04-29 11:17:01,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,649 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2025-04-29 11:17:01,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:01,649 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2025-04-29 11:17:01,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:01,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,650 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,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:17:01,650 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:01,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137561, now seen corresponding path program 1 times [2025-04-29 11:17:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088696984] [2025-04-29 11:17:01,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:01,669 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,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:01,821 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,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:01,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088696984] [2025-04-29 11:17:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088696984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:01,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190794245] [2025-04-29 11:17:01,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:01,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:01,824 INFO L87 Difference]: Start difference. First operand 115 states and 129 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,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,979 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2025-04-29 11:17:01,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:01,979 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,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,980 INFO L225 Difference]: With dead ends: 120 [2025-04-29 11:17:01,980 INFO L226 Difference]: Without dead ends: 120 [2025-04-29 11:17:01,980 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,980 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 205 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.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:01,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 205 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-29 11:17:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-29 11:17:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 119 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-04-29 11:17:01,988 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 19 [2025-04-29 11:17:01,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,988 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-04-29 11:17:01,988 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,988 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-04-29 11:17:01,988 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:01,988 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,991 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,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:17:01,991 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,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137560, now seen corresponding path program 1 times [2025-04-29 11:17:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:01,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068089562] [2025-04-29 11:17:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:01,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:02,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:02,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,178 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:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068089562] [2025-04-29 11:17:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068089562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936716085] [2025-04-29 11:17:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:02,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:02,179 INFO L87 Difference]: Start difference. First operand 120 states and 138 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:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,339 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2025-04-29 11:17:02,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:02,340 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:02,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,341 INFO L225 Difference]: With dead ends: 123 [2025-04-29 11:17:02,342 INFO L226 Difference]: Without dead ends: 123 [2025-04-29 11:17:02,342 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,343 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 266 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.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 266 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-29 11:17:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2025-04-29 11:17:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.425) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-04-29 11:17:02,351 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 19 [2025-04-29 11:17:02,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,351 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-04-29 11:17:02,351 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:02,351 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-04-29 11:17:02,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:17:02,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:02,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:17:02,352 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:02,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1996655894, now seen corresponding path program 1 times [2025-04-29 11:17:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893035046] [2025-04-29 11:17:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:17:02,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:17:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,519 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,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893035046] [2025-04-29 11:17:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893035046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667904803] [2025-04-29 11:17:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:02,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:02,521 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,652 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2025-04-29 11:17:02,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:02,652 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:17:02,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,653 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:17:02,653 INFO L226 Difference]: Without dead ends: 167 [2025-04-29 11:17:02,653 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,654 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:02,654 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 262 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-29 11:17:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2025-04-29 11:17:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2025-04-29 11:17:02,659 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 20 [2025-04-29 11:17:02,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,660 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2025-04-29 11:17:02,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:02,660 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2025-04-29 11:17:02,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:17:02,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,661 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,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:17:02,661 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,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -509806655, now seen corresponding path program 1 times [2025-04-29 11:17:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791862542] [2025-04-29 11:17:02,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:17:02,673 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,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,756 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,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791862542] [2025-04-29 11:17:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791862542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899912997] [2025-04-29 11:17:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:02,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:02,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:02,758 INFO L87 Difference]: Start difference. First operand 114 states and 130 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,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:02,882 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2025-04-29 11:17:02,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:02,883 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,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:02,883 INFO L225 Difference]: With dead ends: 112 [2025-04-29 11:17:02,883 INFO L226 Difference]: Without dead ends: 112 [2025-04-29 11:17:02,884 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,884 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 182 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,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 182 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,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-29 11:17:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-04-29 11:17:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.391304347826087) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2025-04-29 11:17:02,888 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 21 [2025-04-29 11:17:02,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:02,888 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2025-04-29 11:17:02,888 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,888 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2025-04-29 11:17:02,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:17:02,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:02,888 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,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:17:02,889 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,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -509806654, now seen corresponding path program 1 times [2025-04-29 11:17:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208769268] [2025-04-29 11:17:02,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:17:02,904 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,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,063 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:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208769268] [2025-04-29 11:17:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208769268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708982013] [2025-04-29 11:17:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:03,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:03,064 INFO L87 Difference]: Start difference. First operand 112 states and 128 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:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,203 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-04-29 11:17:03,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:03,204 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:03,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,204 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:17:03,204 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:17:03,205 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:03,205 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 233 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:03,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 233 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:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:17:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2025-04-29 11:17:03,207 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:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-04-29 11:17:03,208 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 21 [2025-04-29 11:17:03,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,208 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-04-29 11:17:03,208 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:03,208 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-04-29 11:17:03,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:17:03,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:17:03,209 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:03,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1156193903, now seen corresponding path program 1 times [2025-04-29 11:17:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577142845] [2025-04-29 11:17:03,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:17:03,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:17:03,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,347 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,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577142845] [2025-04-29 11:17:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577142845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569200286] [2025-04-29 11:17:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:03,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:03,348 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,470 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2025-04-29 11:17:03,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:03,470 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:17:03,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,471 INFO L225 Difference]: With dead ends: 135 [2025-04-29 11:17:03,471 INFO L226 Difference]: Without dead ends: 135 [2025-04-29 11:17:03,471 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:03,471 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 62 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 267 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-29 11:17:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2025-04-29 11:17:03,478 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:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-04-29 11:17:03,478 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 22 [2025-04-29 11:17:03,478 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,478 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-04-29 11:17:03,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,479 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-04-29 11:17:03,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:17:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,479 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] [2025-04-29 11:17:03,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:17:03,479 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:03,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -301933066, now seen corresponding path program 1 times [2025-04-29 11:17:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162559690] [2025-04-29 11:17:03,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:17:03,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:17:03,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,529 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:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162559690] [2025-04-29 11:17:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162559690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414214591] [2025-04-29 11:17:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:03,530 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,542 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-04-29 11:17:03,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:03,542 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:17:03,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,542 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:17:03,543 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:17:03,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:03,543 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 129 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:17:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-04-29 11:17:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.36986301369863) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-04-29 11:17:03,546 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 25 [2025-04-29 11:17:03,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,547 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-04-29 11:17:03,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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,547 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-04-29 11:17:03,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:17:03,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:17:03,548 INFO L403 AbstractCegarLoop]: === Iteration 11 === 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,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 356311001, now seen corresponding path program 1 times [2025-04-29 11:17:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348132651] [2025-04-29 11:17:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:03,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:03,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,925 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,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348132651] [2025-04-29 11:17:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348132651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:03,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201105483] [2025-04-29 11:17:03,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:03,929 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,931 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,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:03,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:03,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:17:04,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:04,094 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:17:04,094 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,159 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,288 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:04,288 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,321 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:04,321 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,386 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,446 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,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:04,576 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (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_172) |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,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:04,583 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,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:04,593 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,595 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,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:05,267 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:28,547 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:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201105483] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:28,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-04-29 11:17:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497344088] [2025-04-29 11:17:28,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:17:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:17:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=743, Unknown=15, NotChecked=56, Total=930 [2025-04-29 11:17:28,549 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:29,218 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2025-04-29 11:17:29,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:17:29,218 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:17:29,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:29,219 INFO L225 Difference]: With dead ends: 181 [2025-04-29 11:17:29,219 INFO L226 Difference]: Without dead ends: 181 [2025-04-29 11:17:29,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1323, Unknown=16, NotChecked=76, Total=1640 [2025-04-29 11:17:29,220 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 383 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:29,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 658 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 883 Invalid, 0 Unknown, 201 Unchecked, 0.5s Time] [2025-04-29 11:17:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-29 11:17:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2025-04-29 11:17:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.34375) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2025-04-29 11:17:29,223 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 30 [2025-04-29 11:17:29,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:29,223 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-04-29 11:17:29,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:29,223 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2025-04-29 11:17:29,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:17:29,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:29,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:29,231 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:29,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:17:29,424 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:29,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash 356311002, now seen corresponding path program 1 times [2025-04-29 11:17:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:29,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526381565] [2025-04-29 11:17:29,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:29,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:29,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:29,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:29,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:29,803 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,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:29,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526381565] [2025-04-29 11:17:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526381565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:29,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685883084] [2025-04-29 11:17:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:29,805 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:29,806 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:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:29,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:29,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:29,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:17:29,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:29,910 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:29,910 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:29,916 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:29,944 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:29,948 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:30,038 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:30,038 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:30,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:30,045 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:30,063 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:30,063 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:30,069 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:30,127 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:30,130 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:30,159 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:30,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:30,309 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_234 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_234 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-04-29 11:17:30,318 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_234 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_234 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2025-04-29 11:17:30,328 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,329 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:30,333 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,334 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:30,341 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,341 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:30,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,349 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:30,369 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:30,371 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:30,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,376 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:30,378 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:17:30,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:30,380 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:30,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:30,452 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:30,482 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:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685883084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:30,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-04-29 11:17:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749027709] [2025-04-29 11:17:30,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:30,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:17:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:30,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:17:30,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=752, Unknown=10, NotChecked=114, Total=992 [2025-04-29 11:17:30,483 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:31,204 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2025-04-29 11:17:31,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:17:31,204 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2025-04-29 11:17:31,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:31,205 INFO L225 Difference]: With dead ends: 179 [2025-04-29 11:17:31,205 INFO L226 Difference]: Without dead ends: 179 [2025-04-29 11:17:31,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1684, Unknown=10, NotChecked=174, Total=2162 [2025-04-29 11:17:31,206 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 323 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:31,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 758 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 874 Invalid, 0 Unknown, 371 Unchecked, 0.4s Time] [2025-04-29 11:17:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-29 11:17:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2025-04-29 11:17:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 112 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:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2025-04-29 11:17:31,209 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 30 [2025-04-29 11:17:31,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:31,209 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2025-04-29 11:17:31,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31,209 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2025-04-29 11:17:31,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:17:31,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:31,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:31,215 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:31,414 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,SelfDestructingSolverStorable11 [2025-04-29 11:17:31,414 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:31,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash 857154171, now seen corresponding path program 1 times [2025-04-29 11:17:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:31,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267649671] [2025-04-29 11:17:31,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:31,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:31,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:31,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,610 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:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267649671] [2025-04-29 11:17:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267649671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:31,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125044885] [2025-04-29 11:17:31,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:31,612 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:31,614 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:31,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:31,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:31,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:17:31,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:31,719 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:17:31,719 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:31,752 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,843 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:17:31,844 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,862 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:17:31,862 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:31,909 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,948 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,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:31,999 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |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:32,014 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_295) |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:32,040 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:32,040 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:32,049 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:32,049 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:32,051 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:32,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:32,580 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