./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety/test-0218.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:20,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:20,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:20,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:20,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:20,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:20,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:20,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:20,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:20,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:20,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:20,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:20,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:20,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:20,447 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:20,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:20,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:20,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:20,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:20,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:20,449 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:20,449 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:20,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:20,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:20,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:20,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:20,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:20,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:20,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:20,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:20,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:20,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:20,452 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2025-04-30 10:44:20,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:20,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:20,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:20,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:20,689 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:20,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0218.i [2025-04-30 10:44:21,950 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0973c474f/a0efd595afb5463c9f98994150a38282/FLAGf0f9f0ad0 [2025-04-30 10:44:22,175 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:22,176 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0218.i [2025-04-30 10:44:22,184 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0973c474f/a0efd595afb5463c9f98994150a38282/FLAGf0f9f0ad0 [2025-04-30 10:44:23,000 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0973c474f/a0efd595afb5463c9f98994150a38282 [2025-04-30 10:44:23,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:23,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:23,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:23,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:23,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:23,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b3d749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23, skipping insertion in model container [2025-04-30 10:44:23,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:23,264 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:23,274 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:23,336 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:23,362 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:23,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23 WrapperNode [2025-04-30 10:44:23,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:23,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:23,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:23,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:23,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,399 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-04-30 10:44:23,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:23,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:23,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:23,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:23,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,433 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-04-30 10:44:23,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:23,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:23,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:23,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:23,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (1/1) ... [2025-04-30 10:44:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:23,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:23,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:44:23,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:44:23,495 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-04-30 10:44:23,496 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:23,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:23,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:23,610 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:23,612 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:23,969 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:23,970 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:23,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:23,977 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-30 10:44:23,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:23 BoogieIcfgContainer [2025-04-30 10:44:23,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:23,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:23,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:23,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:23,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:23" (1/3) ... [2025-04-30 10:44:23,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c8cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:23, skipping insertion in model container [2025-04-30 10:44:23,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:23" (2/3) ... [2025-04-30 10:44:23,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c8cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:23, skipping insertion in model container [2025-04-30 10:44:23,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:23" (3/3) ... [2025-04-30 10:44:23,984 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0218.i [2025-04-30 10:44:23,994 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:23,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0218.i that has 2 procedures, 162 locations, 188 edges, 1 initial locations, 6 loop locations, and 65 error locations. [2025-04-30 10:44:24,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:24,031 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;@54c5d01e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:24,031 INFO L341 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-04-30 10:44:24,034 INFO L278 IsEmpty]: Start isEmpty. Operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:24,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:44:24,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,038 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:24,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1074364904, now seen corresponding path program 1 times [2025-04-30 10:44:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649053185] [2025-04-30 10:44:24,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:44:24,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:44:24,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649053185] [2025-04-30 10:44:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649053185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798327471] [2025-04-30 10:44:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:24,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:24,176 INFO L87 Difference]: Start difference. First operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,200 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-04-30 10:44:24,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:24,201 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-30 10:44:24,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,206 INFO L225 Difference]: With dead ends: 162 [2025-04-30 10:44:24,206 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:44:24,207 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-30 10:44:24,209 INFO L437 NwaCegarLoop]: 181 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, 181 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-30 10:44:24,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:44:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-04-30 10:44:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 92 states have (on average 1.9021739130434783) internal successors, (175), 156 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-04-30 10:44:24,237 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 6 [2025-04-30 10:44:24,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,237 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-04-30 10:44:24,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,238 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-04-30 10:44:24,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:24,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:24,238 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:24,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229865, now seen corresponding path program 1 times [2025-04-30 10:44:24,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293387875] [2025-04-30 10:44:24,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:24,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293387875] [2025-04-30 10:44:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293387875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:44:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902077259] [2025-04-30 10:44:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:24,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:24,350 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 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-30 10:44:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,493 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2025-04-30 10:44:24,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:24,493 INFO L79 Accepts]: Start accepts. Automaton has has 3 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-30 10:44:24,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,495 INFO L225 Difference]: With dead ends: 311 [2025-04-30 10:44:24,495 INFO L226 Difference]: Without dead ends: 311 [2025-04-30 10:44:24,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:24,496 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 160 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-30 10:44:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 222. [2025-04-30 10:44:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.8741721854304636) internal successors, (283), 215 states have internal predecessors, (283), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-04-30 10:44:24,515 INFO L79 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 7 [2025-04-30 10:44:24,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,516 INFO L485 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-04-30 10:44:24,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-30 10:44:24,516 INFO L278 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-04-30 10:44:24,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:24,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:24,517 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:24,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229864, now seen corresponding path program 1 times [2025-04-30 10:44:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626544605] [2025-04-30 10:44:24,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626544605] [2025-04-30 10:44:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626544605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:24,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114226236] [2025-04-30 10:44:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:24,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,640 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,747 INFO L93 Difference]: Finished difference Result 225 states and 294 transitions. [2025-04-30 10:44:24,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:24,747 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:44:24,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,748 INFO L225 Difference]: With dead ends: 225 [2025-04-30 10:44:24,748 INFO L226 Difference]: Without dead ends: 225 [2025-04-30 10:44:24,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,749 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 239 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-30 10:44:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2025-04-30 10:44:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 153 states have (on average 1.869281045751634) internal successors, (286), 217 states have internal predecessors, (286), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2025-04-30 10:44:24,763 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 7 [2025-04-30 10:44:24,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,763 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2025-04-30 10:44:24,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,763 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2025-04-30 10:44:24,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:24,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:44:24,764 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:24,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229926, now seen corresponding path program 1 times [2025-04-30 10:44:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131272729] [2025-04-30 10:44:24,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:24,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:24,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131272729] [2025-04-30 10:44:24,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131272729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002123786] [2025-04-30 10:44:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:24,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,841 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,959 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2025-04-30 10:44:24,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:24,959 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:44:24,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,960 INFO L225 Difference]: With dead ends: 224 [2025-04-30 10:44:24,960 INFO L226 Difference]: Without dead ends: 224 [2025-04-30 10:44:24,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,961 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 239 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-04-30 10:44:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2025-04-30 10:44:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.8609271523178808) internal successors, (281), 214 states have internal predecessors, (281), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2025-04-30 10:44:24,967 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 7 [2025-04-30 10:44:24,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,967 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2025-04-30 10:44:24,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,967 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2025-04-30 10:44:24,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:24,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:44:24,967 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:24,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 255682226, now seen corresponding path program 1 times [2025-04-30 10:44:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933984727] [2025-04-30 10:44:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:24,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933984727] [2025-04-30 10:44:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933984727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068291899] [2025-04-30 10:44:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:24,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:24,989 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,088 INFO L93 Difference]: Finished difference Result 302 states and 379 transitions. [2025-04-30 10:44:25,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:25,089 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:25,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,090 INFO L225 Difference]: With dead ends: 302 [2025-04-30 10:44:25,090 INFO L226 Difference]: Without dead ends: 301 [2025-04-30 10:44:25,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:25,091 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 259 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-30 10:44:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 243. [2025-04-30 10:44:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 172 states have (on average 1.813953488372093) internal successors, (312), 235 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:44:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 322 transitions. [2025-04-30 10:44:25,097 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 322 transitions. Word has length 10 [2025-04-30 10:44:25,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,097 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 322 transitions. [2025-04-30 10:44:25,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,097 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 322 transitions. [2025-04-30 10:44:25,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:25,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:25,098 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:25,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 255681842, now seen corresponding path program 1 times [2025-04-30 10:44:25,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788925284] [2025-04-30 10:44:25,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:25,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:25,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788925284] [2025-04-30 10:44:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788925284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657580186] [2025-04-30 10:44:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:25,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:25,195 INFO L87 Difference]: Start difference. First operand 243 states and 322 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,335 INFO L93 Difference]: Finished difference Result 393 states and 504 transitions. [2025-04-30 10:44:25,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:25,335 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:25,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,336 INFO L225 Difference]: With dead ends: 393 [2025-04-30 10:44:25,337 INFO L226 Difference]: Without dead ends: 390 [2025-04-30 10:44:25,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:25,337 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 128 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 742 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-04-30 10:44:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 289. [2025-04-30 10:44:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 213 states have (on average 1.7887323943661972) internal successors, (381), 278 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 397 transitions. [2025-04-30 10:44:25,345 INFO L79 Accepts]: Start accepts. Automaton has 289 states and 397 transitions. Word has length 10 [2025-04-30 10:44:25,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,345 INFO L485 AbstractCegarLoop]: Abstraction has 289 states and 397 transitions. [2025-04-30 10:44:25,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,345 INFO L278 IsEmpty]: Start isEmpty. Operand 289 states and 397 transitions. [2025-04-30 10:44:25,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:25,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:25,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:25,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 253834800, now seen corresponding path program 1 times [2025-04-30 10:44:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365365080] [2025-04-30 10:44:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:25,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:25,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365365080] [2025-04-30 10:44:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365365080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411970834] [2025-04-30 10:44:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:25,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:25,485 INFO L87 Difference]: Start difference. First operand 289 states and 397 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,625 INFO L93 Difference]: Finished difference Result 380 states and 489 transitions. [2025-04-30 10:44:25,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:25,625 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:25,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,627 INFO L225 Difference]: With dead ends: 380 [2025-04-30 10:44:25,627 INFO L226 Difference]: Without dead ends: 375 [2025-04-30 10:44:25,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:25,628 INFO L437 NwaCegarLoop]: 160 mSDtfsCounter, 117 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 707 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-30 10:44:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 284. [2025-04-30 10:44:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.8028846153846154) internal successors, (375), 273 states have internal predecessors, (375), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 391 transitions. [2025-04-30 10:44:25,635 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 391 transitions. Word has length 10 [2025-04-30 10:44:25,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,636 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 391 transitions. [2025-04-30 10:44:25,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,636 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 391 transitions. [2025-04-30 10:44:25,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:25,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:25,636 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:25,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2052292333, now seen corresponding path program 1 times [2025-04-30 10:44:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084206481] [2025-04-30 10:44:25,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:25,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:25,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084206481] [2025-04-30 10:44:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084206481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330565737] [2025-04-30 10:44:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:25,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:25,693 INFO L87 Difference]: Start difference. First operand 284 states and 391 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,856 INFO L93 Difference]: Finished difference Result 379 states and 465 transitions. [2025-04-30 10:44:25,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:25,857 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:25,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,859 INFO L225 Difference]: With dead ends: 379 [2025-04-30 10:44:25,859 INFO L226 Difference]: Without dead ends: 379 [2025-04-30 10:44:25,859 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-30 10:44:25,859 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 163 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,860 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 331 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-04-30 10:44:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 290. [2025-04-30 10:44:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 214 states have (on average 1.780373831775701) internal successors, (381), 279 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-04-30 10:44:25,869 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 15 [2025-04-30 10:44:25,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,871 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-04-30 10:44:25,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,871 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-04-30 10:44:25,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:25,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:25,872 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:25,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2052292334, now seen corresponding path program 1 times [2025-04-30 10:44:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221086400] [2025-04-30 10:44:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:25,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:25,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221086400] [2025-04-30 10:44:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221086400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821256077] [2025-04-30 10:44:25,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:25,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:25,950 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,061 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2025-04-30 10:44:26,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:26,062 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:26,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,063 INFO L225 Difference]: With dead ends: 291 [2025-04-30 10:44:26,063 INFO L226 Difference]: Without dead ends: 291 [2025-04-30 10:44:26,063 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-30 10:44:26,064 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 174 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 226 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-30 10:44:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2025-04-30 10:44:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.7242990654205608) internal successors, (369), 276 states have internal predecessors, (369), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 385 transitions. [2025-04-30 10:44:26,071 INFO L79 Accepts]: Start accepts. Automaton has 287 states and 385 transitions. Word has length 15 [2025-04-30 10:44:26,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,072 INFO L485 AbstractCegarLoop]: Abstraction has 287 states and 385 transitions. [2025-04-30 10:44:26,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,072 INFO L278 IsEmpty]: Start isEmpty. Operand 287 states and 385 transitions. [2025-04-30 10:44:26,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:26,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:44:26,073 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:26,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1331298887, now seen corresponding path program 1 times [2025-04-30 10:44:26,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000816322] [2025-04-30 10:44:26,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:26,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:26,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000816322] [2025-04-30 10:44:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000816322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862258768] [2025-04-30 10:44:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:26,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:26,196 INFO L87 Difference]: Start difference. First operand 287 states and 385 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,396 INFO L93 Difference]: Finished difference Result 392 states and 486 transitions. [2025-04-30 10:44:26,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:26,396 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:26,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,398 INFO L225 Difference]: With dead ends: 392 [2025-04-30 10:44:26,398 INFO L226 Difference]: Without dead ends: 392 [2025-04-30 10:44:26,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:26,399 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 329 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 310 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-30 10:44:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 284. [2025-04-30 10:44:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.6883720930232557) internal successors, (363), 273 states have internal predecessors, (363), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 379 transitions. [2025-04-30 10:44:26,407 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 379 transitions. Word has length 17 [2025-04-30 10:44:26,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,408 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 379 transitions. [2025-04-30 10:44:26,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,408 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 379 transitions. [2025-04-30 10:44:26,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:26,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:44:26,409 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:26,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1331298886, now seen corresponding path program 1 times [2025-04-30 10:44:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130139493] [2025-04-30 10:44:26,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:26,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130139493] [2025-04-30 10:44:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130139493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205155108] [2025-04-30 10:44:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:26,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:26,566 INFO L87 Difference]: Start difference. First operand 284 states and 379 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,728 INFO L93 Difference]: Finished difference Result 356 states and 480 transitions. [2025-04-30 10:44:26,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:26,728 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:26,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,729 INFO L225 Difference]: With dead ends: 356 [2025-04-30 10:44:26,729 INFO L226 Difference]: Without dead ends: 356 [2025-04-30 10:44:26,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:26,730 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 460 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-30 10:44:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 346. [2025-04-30 10:44:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6703296703296704) internal successors, (456), 333 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 480 transitions. [2025-04-30 10:44:26,742 INFO L79 Accepts]: Start accepts. Automaton has 346 states and 480 transitions. Word has length 17 [2025-04-30 10:44:26,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,742 INFO L485 AbstractCegarLoop]: Abstraction has 346 states and 480 transitions. [2025-04-30 10:44:26,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,743 INFO L278 IsEmpty]: Start isEmpty. Operand 346 states and 480 transitions. [2025-04-30 10:44:26,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:26,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:44:26,743 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:26,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1156213947, now seen corresponding path program 1 times [2025-04-30 10:44:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445993616] [2025-04-30 10:44:26,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:26,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445993616] [2025-04-30 10:44:26,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445993616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358827142] [2025-04-30 10:44:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:26,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:26,815 INFO L87 Difference]: Start difference. First operand 346 states and 480 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,843 INFO L93 Difference]: Finished difference Result 346 states and 478 transitions. [2025-04-30 10:44:26,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:26,844 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:26,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,845 INFO L225 Difference]: With dead ends: 346 [2025-04-30 10:44:26,845 INFO L226 Difference]: Without dead ends: 346 [2025-04-30 10:44:26,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:26,845 INFO L437 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 856 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-30 10:44:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-04-30 10:44:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.663003663003663) internal successors, (454), 333 states have internal predecessors, (454), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-04-30 10:44:26,852 INFO L79 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 17 [2025-04-30 10:44:26,852 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,852 INFO L485 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-04-30 10:44:26,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,852 INFO L278 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-04-30 10:44:26,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:44:26,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:44:26,853 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:26,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1482949595, now seen corresponding path program 1 times [2025-04-30 10:44:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894304082] [2025-04-30 10:44:26,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:26,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:26,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894304082] [2025-04-30 10:44:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894304082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34553887] [2025-04-30 10:44:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:26,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:26,971 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,149 INFO L93 Difference]: Finished difference Result 397 states and 549 transitions. [2025-04-30 10:44:27,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:27,150 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-04-30 10:44:27,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,151 INFO L225 Difference]: With dead ends: 397 [2025-04-30 10:44:27,151 INFO L226 Difference]: Without dead ends: 397 [2025-04-30 10:44:27,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:27,152 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 199 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 548 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-30 10:44:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 341. [2025-04-30 10:44:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.664179104477612) internal successors, (446), 328 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 470 transitions. [2025-04-30 10:44:27,172 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 470 transitions. Word has length 18 [2025-04-30 10:44:27,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,173 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 470 transitions. [2025-04-30 10:44:27,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,173 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 470 transitions. [2025-04-30 10:44:27,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:27,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:27,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:44:27,173 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:27,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -845528256, now seen corresponding path program 1 times [2025-04-30 10:44:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031770870] [2025-04-30 10:44:27,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:27,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031770870] [2025-04-30 10:44:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031770870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594434655] [2025-04-30 10:44:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:27,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:27,334 INFO L87 Difference]: Start difference. First operand 341 states and 470 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,531 INFO L93 Difference]: Finished difference Result 482 states and 637 transitions. [2025-04-30 10:44:27,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:27,532 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-30 10:44:27,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,534 INFO L225 Difference]: With dead ends: 482 [2025-04-30 10:44:27,534 INFO L226 Difference]: Without dead ends: 482 [2025-04-30 10:44:27,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:27,534 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 145 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1016 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-04-30 10:44:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 359. [2025-04-30 10:44:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 286 states have (on average 1.6398601398601398) internal successors, (469), 344 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 493 transitions. [2025-04-30 10:44:27,545 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 493 transitions. Word has length 21 [2025-04-30 10:44:27,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,545 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 493 transitions. [2025-04-30 10:44:27,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,545 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 493 transitions. [2025-04-30 10:44:27,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:27,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:27,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:44:27,546 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:27,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1812248817, now seen corresponding path program 1 times [2025-04-30 10:44:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665577315] [2025-04-30 10:44:27,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:27,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:27,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:27,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665577315] [2025-04-30 10:44:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665577315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113875388] [2025-04-30 10:44:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:27,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:27,714 INFO L87 Difference]: Start difference. First operand 359 states and 493 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,985 INFO L93 Difference]: Finished difference Result 458 states and 604 transitions. [2025-04-30 10:44:27,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:27,986 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-30 10:44:27,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,987 INFO L225 Difference]: With dead ends: 458 [2025-04-30 10:44:27,987 INFO L226 Difference]: Without dead ends: 458 [2025-04-30 10:44:27,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:27,988 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 108 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 995 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-04-30 10:44:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 353. [2025-04-30 10:44:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 280 states have (on average 1.6357142857142857) internal successors, (458), 338 states have internal predecessors, (458), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 482 transitions. [2025-04-30 10:44:27,995 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 482 transitions. Word has length 21 [2025-04-30 10:44:27,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,995 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 482 transitions. [2025-04-30 10:44:27,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,995 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 482 transitions. [2025-04-30 10:44:27,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:44:27,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,996 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-30 10:44:27,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:44:27,996 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:27,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1128902431, now seen corresponding path program 1 times [2025-04-30 10:44:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766113950] [2025-04-30 10:44:27,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:44:28,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:44:28,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766113950] [2025-04-30 10:44:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766113950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638363968] [2025-04-30 10:44:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:28,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:28,117 INFO L87 Difference]: Start difference. First operand 353 states and 482 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,312 INFO L93 Difference]: Finished difference Result 474 states and 620 transitions. [2025-04-30 10:44:28,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:28,313 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-04-30 10:44:28,313 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,314 INFO L225 Difference]: With dead ends: 474 [2025-04-30 10:44:28,314 INFO L226 Difference]: Without dead ends: 474 [2025-04-30 10:44:28,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:28,315 INFO L437 NwaCegarLoop]: 174 mSDtfsCounter, 116 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1112 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-04-30 10:44:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 361. [2025-04-30 10:44:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 288 states have (on average 1.6180555555555556) internal successors, (466), 344 states have internal predecessors, (466), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 490 transitions. [2025-04-30 10:44:28,321 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 490 transitions. Word has length 22 [2025-04-30 10:44:28,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,321 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 490 transitions. [2025-04-30 10:44:28,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,322 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 490 transitions. [2025-04-30 10:44:28,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:28,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,323 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] [2025-04-30 10:44:28,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:44:28,323 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:28,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2116999516, now seen corresponding path program 1 times [2025-04-30 10:44:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752070906] [2025-04-30 10:44:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752070906] [2025-04-30 10:44:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752070906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548011926] [2025-04-30 10:44:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:28,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:28,385 INFO L87 Difference]: Start difference. First operand 361 states and 490 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,475 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2025-04-30 10:44:28,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:28,476 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-04-30 10:44:28,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,477 INFO L225 Difference]: With dead ends: 361 [2025-04-30 10:44:28,477 INFO L226 Difference]: Without dead ends: 361 [2025-04-30 10:44:28,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:28,477 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 458 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-30 10:44:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2025-04-30 10:44:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 289 states have (on average 1.5847750865051904) internal successors, (458), 339 states have internal predecessors, (458), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:44:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 482 transitions. [2025-04-30 10:44:28,484 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 482 transitions. Word has length 23 [2025-04-30 10:44:28,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,484 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 482 transitions. [2025-04-30 10:44:28,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,484 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 482 transitions. [2025-04-30 10:44:28,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:28,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,485 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] [2025-04-30 10:44:28,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:44:28,485 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:28,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2116999517, now seen corresponding path program 1 times [2025-04-30 10:44:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665196740] [2025-04-30 10:44:28,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:28,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:28,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665196740] [2025-04-30 10:44:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665196740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091779752] [2025-04-30 10:44:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:28,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:28,600 INFO L87 Difference]: Start difference. First operand 356 states and 482 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,740 INFO L93 Difference]: Finished difference Result 333 states and 442 transitions. [2025-04-30 10:44:28,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:28,740 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-04-30 10:44:28,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,741 INFO L225 Difference]: With dead ends: 333 [2025-04-30 10:44:28,741 INFO L226 Difference]: Without dead ends: 333 [2025-04-30 10:44:28,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:28,741 INFO L437 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1007 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-30 10:44:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2025-04-30 10:44:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 240 states have (on average 1.6125) internal successors, (387), 290 states have internal predecessors, (387), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 405 transitions. [2025-04-30 10:44:28,747 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 405 transitions. Word has length 23 [2025-04-30 10:44:28,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,747 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 405 transitions. [2025-04-30 10:44:28,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,747 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 405 transitions. [2025-04-30 10:44:28,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:28,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,747 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-30 10:44:28,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:44:28,747 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:28,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 302359058, now seen corresponding path program 1 times [2025-04-30 10:44:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889674355] [2025-04-30 10:44:28,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:28,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:28,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889674355] [2025-04-30 10:44:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889674355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318197959] [2025-04-30 10:44:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:28,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,773 INFO L87 Difference]: Start difference. First operand 303 states and 405 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,788 INFO L93 Difference]: Finished difference Result 315 states and 417 transitions. [2025-04-30 10:44:28,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:28,789 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:28,789 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,789 INFO L225 Difference]: With dead ends: 315 [2025-04-30 10:44:28,789 INFO L226 Difference]: Without dead ends: 315 [2025-04-30 10:44:28,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,790 INFO L437 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-30 10:44:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-04-30 10:44:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 252 states have (on average 1.5833333333333333) internal successors, (399), 302 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 417 transitions. [2025-04-30 10:44:28,796 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 417 transitions. Word has length 25 [2025-04-30 10:44:28,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,796 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 417 transitions. [2025-04-30 10:44:28,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,796 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 417 transitions. [2025-04-30 10:44:28,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:28,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,796 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-30 10:44:28,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:44:28,796 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:28,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 304206100, now seen corresponding path program 1 times [2025-04-30 10:44:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141971858] [2025-04-30 10:44:28,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141971858] [2025-04-30 10:44:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141971858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333924489] [2025-04-30 10:44:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:28,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:28,823 INFO L87 Difference]: Start difference. First operand 315 states and 417 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,876 INFO L93 Difference]: Finished difference Result 313 states and 409 transitions. [2025-04-30 10:44:28,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:28,876 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:28,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,877 INFO L225 Difference]: With dead ends: 313 [2025-04-30 10:44:28,877 INFO L226 Difference]: Without dead ends: 313 [2025-04-30 10:44:28,877 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:28,878 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 219 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-30 10:44:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-04-30 10:44:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.5515873015873016) internal successors, (391), 300 states have internal predecessors, (391), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 409 transitions. [2025-04-30 10:44:28,884 INFO L79 Accepts]: Start accepts. Automaton has 313 states and 409 transitions. Word has length 25 [2025-04-30 10:44:28,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,884 INFO L485 AbstractCegarLoop]: Abstraction has 313 states and 409 transitions. [2025-04-30 10:44:28,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,885 INFO L278 IsEmpty]: Start isEmpty. Operand 313 states and 409 transitions. [2025-04-30 10:44:28,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:28,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,886 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-30 10:44:28,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:44:28,886 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:28,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 304206101, now seen corresponding path program 1 times [2025-04-30 10:44:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106746109] [2025-04-30 10:44:28,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106746109] [2025-04-30 10:44:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106746109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102849141] [2025-04-30 10:44:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:28,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,941 INFO L87 Difference]: Start difference. First operand 313 states and 409 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,012 INFO L93 Difference]: Finished difference Result 391 states and 512 transitions. [2025-04-30 10:44:29,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:29,013 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:29,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,014 INFO L225 Difference]: With dead ends: 391 [2025-04-30 10:44:29,014 INFO L226 Difference]: Without dead ends: 391 [2025-04-30 10:44:29,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,014 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 245 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-04-30 10:44:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2025-04-30 10:44:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5246913580246915) internal successors, (494), 372 states have internal predecessors, (494), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 512 transitions. [2025-04-30 10:44:29,021 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 512 transitions. Word has length 25 [2025-04-30 10:44:29,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,023 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 512 transitions. [2025-04-30 10:44:29,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,023 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 512 transitions. [2025-04-30 10:44:29,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:29,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:44:29,024 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 247088151, now seen corresponding path program 1 times [2025-04-30 10:44:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855353227] [2025-04-30 10:44:29,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:29,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:29,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855353227] [2025-04-30 10:44:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855353227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420697143] [2025-04-30 10:44:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,077 INFO L87 Difference]: Start difference. First operand 385 states and 512 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,097 INFO L93 Difference]: Finished difference Result 434 states and 575 transitions. [2025-04-30 10:44:29,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,098 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:29,098 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,099 INFO L225 Difference]: With dead ends: 434 [2025-04-30 10:44:29,100 INFO L226 Difference]: Without dead ends: 434 [2025-04-30 10:44:29,100 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:29,101 INFO L437 NwaCegarLoop]: 160 mSDtfsCounter, 44 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 790 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-04-30 10:44:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 385. [2025-04-30 10:44:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5154320987654322) internal successors, (491), 372 states have internal predecessors, (491), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2025-04-30 10:44:29,108 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 26 [2025-04-30 10:44:29,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,108 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2025-04-30 10:44:29,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,108 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2025-04-30 10:44:29,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:29,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:44:29,109 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash -749984202, now seen corresponding path program 1 times [2025-04-30 10:44:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52593656] [2025-04-30 10:44:29,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:29,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:29,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52593656] [2025-04-30 10:44:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52593656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668981983] [2025-04-30 10:44:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,161 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,235 INFO L93 Difference]: Finished difference Result 463 states and 612 transitions. [2025-04-30 10:44:29,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:29,236 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:29,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,237 INFO L225 Difference]: With dead ends: 463 [2025-04-30 10:44:29,237 INFO L226 Difference]: Without dead ends: 463 [2025-04-30 10:44:29,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,238 INFO L437 NwaCegarLoop]: 154 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 259 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-04-30 10:44:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 385. [2025-04-30 10:44:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5154320987654322) internal successors, (491), 372 states have internal predecessors, (491), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2025-04-30 10:44:29,246 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 26 [2025-04-30 10:44:29,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,246 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2025-04-30 10:44:29,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,247 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2025-04-30 10:44:29,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:29,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:44:29,247 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -48919624, now seen corresponding path program 1 times [2025-04-30 10:44:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901907407] [2025-04-30 10:44:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:29,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901907407] [2025-04-30 10:44:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901907407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:29,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926585237] [2025-04-30 10:44:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,299 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,316 INFO L93 Difference]: Finished difference Result 312 states and 399 transitions. [2025-04-30 10:44:29,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,316 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:29,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,318 INFO L225 Difference]: With dead ends: 312 [2025-04-30 10:44:29,318 INFO L226 Difference]: Without dead ends: 312 [2025-04-30 10:44:29,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,318 INFO L437 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-30 10:44:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-04-30 10:44:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 252 states have (on average 1.5119047619047619) internal successors, (381), 299 states have internal predecessors, (381), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2025-04-30 10:44:29,326 INFO L79 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 26 [2025-04-30 10:44:29,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,326 INFO L485 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2025-04-30 10:44:29,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,326 INFO L278 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2025-04-30 10:44:29,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:29,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:44:29,327 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 284288149, now seen corresponding path program 1 times [2025-04-30 10:44:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043684394] [2025-04-30 10:44:29,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043684394] [2025-04-30 10:44:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043684394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241457678] [2025-04-30 10:44:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:29,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:29,413 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,529 INFO L93 Difference]: Finished difference Result 350 states and 445 transitions. [2025-04-30 10:44:29,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:29,529 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-04-30 10:44:29,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,530 INFO L225 Difference]: With dead ends: 350 [2025-04-30 10:44:29,530 INFO L226 Difference]: Without dead ends: 350 [2025-04-30 10:44:29,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:29,531 INFO L437 NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 676 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-30 10:44:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 344. [2025-04-30 10:44:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 284 states have (on average 1.4753521126760563) internal successors, (419), 331 states have internal predecessors, (419), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 437 transitions. [2025-04-30 10:44:29,537 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 437 transitions. Word has length 27 [2025-04-30 10:44:29,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,537 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 437 transitions. [2025-04-30 10:44:29,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,537 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 437 transitions. [2025-04-30 10:44:29,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:29,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:44:29,537 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 284288343, now seen corresponding path program 1 times [2025-04-30 10:44:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600450636] [2025-04-30 10:44:29,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:29,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:29,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600450636] [2025-04-30 10:44:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600450636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943152531] [2025-04-30 10:44:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:29,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:29,593 INFO L87 Difference]: Start difference. First operand 344 states and 437 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,664 INFO L93 Difference]: Finished difference Result 491 states and 634 transitions. [2025-04-30 10:44:29,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:29,665 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-04-30 10:44:29,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,666 INFO L225 Difference]: With dead ends: 491 [2025-04-30 10:44:29,666 INFO L226 Difference]: Without dead ends: 491 [2025-04-30 10:44:29,666 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-30 10:44:29,666 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 71 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 505 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-30 10:44:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 456. [2025-04-30 10:44:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 396 states have (on average 1.4545454545454546) internal successors, (576), 443 states have internal predecessors, (576), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 594 transitions. [2025-04-30 10:44:29,674 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 594 transitions. Word has length 27 [2025-04-30 10:44:29,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,674 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 594 transitions. [2025-04-30 10:44:29,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,675 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 594 transitions. [2025-04-30 10:44:29,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:29,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:44:29,675 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 819689016, now seen corresponding path program 1 times [2025-04-30 10:44:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723397883] [2025-04-30 10:44:29,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:29,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:29,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723397883] [2025-04-30 10:44:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723397883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745703017] [2025-04-30 10:44:29,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:29,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:29,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,736 INFO L87 Difference]: Start difference. First operand 456 states and 594 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,824 INFO L93 Difference]: Finished difference Result 491 states and 626 transitions. [2025-04-30 10:44:29,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:29,825 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-30 10:44:29,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,826 INFO L225 Difference]: With dead ends: 491 [2025-04-30 10:44:29,826 INFO L226 Difference]: Without dead ends: 491 [2025-04-30 10:44:29,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,826 INFO L437 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 349 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-30 10:44:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 343. [2025-04-30 10:44:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 284 states have (on average 1.4471830985915493) internal successors, (411), 330 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 429 transitions. [2025-04-30 10:44:29,833 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 429 transitions. Word has length 28 [2025-04-30 10:44:29,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,833 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 429 transitions. [2025-04-30 10:44:29,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,833 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 429 transitions. [2025-04-30 10:44:29,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:44:29,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:44:29,834 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 474791138, now seen corresponding path program 1 times [2025-04-30 10:44:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301114832] [2025-04-30 10:44:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:44:29,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:44:29,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301114832] [2025-04-30 10:44:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301114832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694259900] [2025-04-30 10:44:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:29,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:29,879 INFO L87 Difference]: Start difference. First operand 343 states and 429 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,964 INFO L93 Difference]: Finished difference Result 344 states and 429 transitions. [2025-04-30 10:44:29,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:29,964 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-04-30 10:44:29,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,965 INFO L225 Difference]: With dead ends: 344 [2025-04-30 10:44:29,965 INFO L226 Difference]: Without dead ends: 344 [2025-04-30 10:44:29,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:29,966 INFO L437 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 405 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-30 10:44:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2025-04-30 10:44:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 284 states have (on average 1.4401408450704225) internal successors, (409), 329 states have internal predecessors, (409), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 427 transitions. [2025-04-30 10:44:29,972 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 427 transitions. Word has length 33 [2025-04-30 10:44:29,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,972 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 427 transitions. [2025-04-30 10:44:29,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,972 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 427 transitions. [2025-04-30 10:44:29,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:44:29,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:44:29,973 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:29,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 474791139, now seen corresponding path program 1 times [2025-04-30 10:44:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616963917] [2025-04-30 10:44:29,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:44:29,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:44:29,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616963917] [2025-04-30 10:44:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616963917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245916563] [2025-04-30 10:44:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:30,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,060 INFO L87 Difference]: Start difference. First operand 342 states and 427 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,144 INFO L93 Difference]: Finished difference Result 343 states and 427 transitions. [2025-04-30 10:44:30,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:30,144 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-04-30 10:44:30,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,145 INFO L225 Difference]: With dead ends: 343 [2025-04-30 10:44:30,145 INFO L226 Difference]: Without dead ends: 343 [2025-04-30 10:44:30,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,146 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 417 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-30 10:44:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-04-30 10:44:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 328 states have internal predecessors, (407), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 425 transitions. [2025-04-30 10:44:30,151 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 425 transitions. Word has length 33 [2025-04-30 10:44:30,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,151 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 425 transitions. [2025-04-30 10:44:30,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,152 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 425 transitions. [2025-04-30 10:44:30,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:44:30,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:44:30,152 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:30,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753443, now seen corresponding path program 1 times [2025-04-30 10:44:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000288437] [2025-04-30 10:44:30,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:44:30,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:44:30,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000288437] [2025-04-30 10:44:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000288437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496343055] [2025-04-30 10:44:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:30,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,203 INFO L87 Difference]: Start difference. First operand 341 states and 425 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,295 INFO L93 Difference]: Finished difference Result 347 states and 421 transitions. [2025-04-30 10:44:30,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:30,296 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-30 10:44:30,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,297 INFO L225 Difference]: With dead ends: 347 [2025-04-30 10:44:30,297 INFO L226 Difference]: Without dead ends: 347 [2025-04-30 10:44:30,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,298 INFO L437 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 419 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-30 10:44:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 338. [2025-04-30 10:44:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 284 states have (on average 1.4119718309859155) internal successors, (401), 325 states have internal predecessors, (401), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 419 transitions. [2025-04-30 10:44:30,303 INFO L79 Accepts]: Start accepts. Automaton has 338 states and 419 transitions. Word has length 35 [2025-04-30 10:44:30,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,303 INFO L485 AbstractCegarLoop]: Abstraction has 338 states and 419 transitions. [2025-04-30 10:44:30,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,303 INFO L278 IsEmpty]: Start isEmpty. Operand 338 states and 419 transitions. [2025-04-30 10:44:30,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:44:30,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:44:30,304 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:30,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753444, now seen corresponding path program 1 times [2025-04-30 10:44:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898100260] [2025-04-30 10:44:30,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:44:30,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:44:30,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898100260] [2025-04-30 10:44:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898100260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414995038] [2025-04-30 10:44:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:30,410 INFO L87 Difference]: Start difference. First operand 338 states and 419 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,540 INFO L93 Difference]: Finished difference Result 346 states and 419 transitions. [2025-04-30 10:44:30,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:30,541 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-30 10:44:30,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,542 INFO L225 Difference]: With dead ends: 346 [2025-04-30 10:44:30,542 INFO L226 Difference]: Without dead ends: 346 [2025-04-30 10:44:30,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:30,543 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 275 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 403 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-30 10:44:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 337. [2025-04-30 10:44:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 284 states have (on average 1.4049295774647887) internal successors, (399), 324 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 417 transitions. [2025-04-30 10:44:30,549 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 417 transitions. Word has length 35 [2025-04-30 10:44:30,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,549 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 417 transitions. [2025-04-30 10:44:30,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,549 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 417 transitions. [2025-04-30 10:44:30,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:44:30,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:44:30,550 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:30,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753605, now seen corresponding path program 1 times [2025-04-30 10:44:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271365699] [2025-04-30 10:44:30,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:44:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:44:30,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271365699] [2025-04-30 10:44:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271365699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669669517] [2025-04-30 10:44:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:30,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:30,697 INFO L87 Difference]: Start difference. First operand 337 states and 417 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,765 INFO L93 Difference]: Finished difference Result 337 states and 415 transitions. [2025-04-30 10:44:30,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:30,766 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-30 10:44:30,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,767 INFO L225 Difference]: With dead ends: 337 [2025-04-30 10:44:30,767 INFO L226 Difference]: Without dead ends: 337 [2025-04-30 10:44:30,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,768 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 177 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 173 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-30 10:44:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-04-30 10:44:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 284 states have (on average 1.3908450704225352) internal successors, (395), 322 states have internal predecessors, (395), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2025-04-30 10:44:30,775 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 35 [2025-04-30 10:44:30,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,775 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2025-04-30 10:44:30,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,775 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2025-04-30 10:44:30,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:44:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:44:30,776 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:30,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1440975970, now seen corresponding path program 1 times [2025-04-30 10:44:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131018] [2025-04-30 10:44:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:44:30,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:44:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:31,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131018] [2025-04-30 10:44:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:44:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877921807] [2025-04-30 10:44:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:31,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:31,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:31,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:31,304 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:31,703 INFO L93 Difference]: Finished difference Result 366 states and 445 transitions. [2025-04-30 10:44:31,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:31,704 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-04-30 10:44:31,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:31,705 INFO L225 Difference]: With dead ends: 366 [2025-04-30 10:44:31,705 INFO L226 Difference]: Without dead ends: 366 [2025-04-30 10:44:31,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:44:31,706 INFO L437 NwaCegarLoop]: 132 mSDtfsCounter, 93 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:31,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 871 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-30 10:44:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 357. [2025-04-30 10:44:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 306 states have (on average 1.3660130718954249) internal successors, (418), 344 states have internal predecessors, (418), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2025-04-30 10:44:31,713 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 49 [2025-04-30 10:44:31,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:31,713 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2025-04-30 10:44:31,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:31,713 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2025-04-30 10:44:31,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:31,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:31,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:31,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:44:31,714 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:31,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash -209726198, now seen corresponding path program 1 times [2025-04-30 10:44:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:31,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997462691] [2025-04-30 10:44:31,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:31,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:31,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997462691] [2025-04-30 10:44:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997462691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:44:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889821332] [2025-04-30 10:44:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:31,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:31,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:31,901 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:32,086 INFO L93 Difference]: Finished difference Result 587 states and 718 transitions. [2025-04-30 10:44:32,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:32,086 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-04-30 10:44:32,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:32,088 INFO L225 Difference]: With dead ends: 587 [2025-04-30 10:44:32,088 INFO L226 Difference]: Without dead ends: 587 [2025-04-30 10:44:32,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:32,088 INFO L437 NwaCegarLoop]: 155 mSDtfsCounter, 171 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:32,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1048 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-04-30 10:44:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2025-04-30 10:44:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 374 states have (on average 1.3796791443850267) internal successors, (516), 416 states have internal predecessors, (516), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 546 transitions. [2025-04-30 10:44:32,096 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 546 transitions. Word has length 50 [2025-04-30 10:44:32,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:32,097 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 546 transitions. [2025-04-30 10:44:32,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,097 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2025-04-30 10:44:32,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:32,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:32,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:32,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:44:32,098 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:32,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:32,098 INFO L85 PathProgramCache]: Analyzing trace with hash -209726582, now seen corresponding path program 1 times [2025-04-30 10:44:32,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:32,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776486363] [2025-04-30 10:44:32,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:32,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:32,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:32,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776486363] [2025-04-30 10:44:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776486363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:32,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:44:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651231541] [2025-04-30 10:44:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:32,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:32,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:32,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:32,286 INFO L87 Difference]: Start difference. First operand 433 states and 546 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:32,514 INFO L93 Difference]: Finished difference Result 616 states and 766 transitions. [2025-04-30 10:44:32,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:32,515 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-04-30 10:44:32,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:32,516 INFO L225 Difference]: With dead ends: 616 [2025-04-30 10:44:32,517 INFO L226 Difference]: Without dead ends: 616 [2025-04-30 10:44:32,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:32,517 INFO L437 NwaCegarLoop]: 144 mSDtfsCounter, 169 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:32,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 810 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-04-30 10:44:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 462. [2025-04-30 10:44:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 400 states have (on average 1.3775) internal successors, (551), 443 states have internal predecessors, (551), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-30 10:44:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 587 transitions. [2025-04-30 10:44:32,526 INFO L79 Accepts]: Start accepts. Automaton has 462 states and 587 transitions. Word has length 50 [2025-04-30 10:44:32,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:32,527 INFO L485 AbstractCegarLoop]: Abstraction has 462 states and 587 transitions. [2025-04-30 10:44:32,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,527 INFO L278 IsEmpty]: Start isEmpty. Operand 462 states and 587 transitions. [2025-04-30 10:44:32,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:32,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:32,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:32,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:44:32,529 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:32,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash -209726581, now seen corresponding path program 1 times [2025-04-30 10:44:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:32,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329773032] [2025-04-30 10:44:32,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:32,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:32,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:32,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:32,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329773032] [2025-04-30 10:44:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329773032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:32,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:32,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839012387] [2025-04-30 10:44:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:32,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:32,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:32,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:32,818 INFO L87 Difference]: Start difference. First operand 462 states and 587 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:33,122 INFO L93 Difference]: Finished difference Result 612 states and 751 transitions. [2025-04-30 10:44:33,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:33,122 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-04-30 10:44:33,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:33,124 INFO L225 Difference]: With dead ends: 612 [2025-04-30 10:44:33,124 INFO L226 Difference]: Without dead ends: 612 [2025-04-30 10:44:33,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:33,125 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 158 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:33,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 891 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-04-30 10:44:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 465. [2025-04-30 10:44:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 403 states have (on average 1.3746898263027296) internal successors, (554), 446 states have internal predecessors, (554), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-30 10:44:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 590 transitions. [2025-04-30 10:44:33,134 INFO L79 Accepts]: Start accepts. Automaton has 465 states and 590 transitions. Word has length 50 [2025-04-30 10:44:33,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:33,134 INFO L485 AbstractCegarLoop]: Abstraction has 465 states and 590 transitions. [2025-04-30 10:44:33,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:33,134 INFO L278 IsEmpty]: Start isEmpty. Operand 465 states and 590 transitions. [2025-04-30 10:44:33,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:33,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:33,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:33,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:44:33,136 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:33,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash -211573240, now seen corresponding path program 1 times [2025-04-30 10:44:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:33,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962085200] [2025-04-30 10:44:33,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:33,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:33,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:33,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:33,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:33,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:33,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:33,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962085200] [2025-04-30 10:44:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962085200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:33,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-30 10:44:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932191708] [2025-04-30 10:44:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:33,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:33,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:33,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:33,591 INFO L87 Difference]: Start difference. First operand 465 states and 590 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:34,120 INFO L93 Difference]: Finished difference Result 589 states and 711 transitions. [2025-04-30 10:44:34,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:34,120 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-04-30 10:44:34,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:34,122 INFO L225 Difference]: With dead ends: 589 [2025-04-30 10:44:34,122 INFO L226 Difference]: Without dead ends: 589 [2025-04-30 10:44:34,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:44:34,123 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 270 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:34,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 961 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-04-30 10:44:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2025-04-30 10:44:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 433 states have (on average 1.3602771362586605) internal successors, (589), 476 states have internal predecessors, (589), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-30 10:44:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 625 transitions. [2025-04-30 10:44:34,135 INFO L79 Accepts]: Start accepts. Automaton has 495 states and 625 transitions. Word has length 50 [2025-04-30 10:44:34,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:34,135 INFO L485 AbstractCegarLoop]: Abstraction has 495 states and 625 transitions. [2025-04-30 10:44:34,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:34,135 INFO L278 IsEmpty]: Start isEmpty. Operand 495 states and 625 transitions. [2025-04-30 10:44:34,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:34,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:34,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:34,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-30 10:44:34,137 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:34,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 554808767, now seen corresponding path program 1 times [2025-04-30 10:44:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:34,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757684391] [2025-04-30 10:44:34,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:34,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:34,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:34,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:34,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757684391] [2025-04-30 10:44:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757684391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-30 10:44:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884654010] [2025-04-30 10:44:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:34,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:44:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:34,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:44:34,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:44:34,744 INFO L87 Difference]: Start difference. First operand 495 states and 625 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:35,428 INFO L93 Difference]: Finished difference Result 590 states and 715 transitions. [2025-04-30 10:44:35,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:44:35,428 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-04-30 10:44:35,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:35,430 INFO L225 Difference]: With dead ends: 590 [2025-04-30 10:44:35,430 INFO L226 Difference]: Without dead ends: 590 [2025-04-30 10:44:35,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:44:35,431 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 214 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:35,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1397 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:44:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-04-30 10:44:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 490. [2025-04-30 10:44:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 428 states have (on average 1.3714953271028036) internal successors, (587), 471 states have internal predecessors, (587), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-30 10:44:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 623 transitions. [2025-04-30 10:44:35,444 INFO L79 Accepts]: Start accepts. Automaton has 490 states and 623 transitions. Word has length 50 [2025-04-30 10:44:35,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:35,444 INFO L485 AbstractCegarLoop]: Abstraction has 490 states and 623 transitions. [2025-04-30 10:44:35,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:35,446 INFO L278 IsEmpty]: Start isEmpty. Operand 490 states and 623 transitions. [2025-04-30 10:44:35,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:35,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:35,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:35,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-30 10:44:35,446 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:35,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 455878436, now seen corresponding path program 1 times [2025-04-30 10:44:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:35,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039107570] [2025-04-30 10:44:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:35,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:35,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:35,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039107570] [2025-04-30 10:44:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039107570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:35,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:35,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-30 10:44:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145382011] [2025-04-30 10:44:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:35,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:44:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:44:35,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:35,873 INFO L87 Difference]: Start difference. First operand 490 states and 623 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:36,249 INFO L93 Difference]: Finished difference Result 945 states and 1196 transitions. [2025-04-30 10:44:36,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:44:36,249 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:36,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:36,252 INFO L225 Difference]: With dead ends: 945 [2025-04-30 10:44:36,253 INFO L226 Difference]: Without dead ends: 945 [2025-04-30 10:44:36,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:44:36,253 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 397 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:36,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1580 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-04-30 10:44:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 729. [2025-04-30 10:44:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 647 states have (on average 1.3771251931993818) internal successors, (891), 700 states have internal predecessors, (891), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2025-04-30 10:44:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 957 transitions. [2025-04-30 10:44:36,268 INFO L79 Accepts]: Start accepts. Automaton has 729 states and 957 transitions. Word has length 51 [2025-04-30 10:44:36,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:36,269 INFO L485 AbstractCegarLoop]: Abstraction has 729 states and 957 transitions. [2025-04-30 10:44:36,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:36,270 INFO L278 IsEmpty]: Start isEmpty. Operand 729 states and 957 transitions. [2025-04-30 10:44:36,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:36,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:36,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:36,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-30 10:44:36,271 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:36,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 455878052, now seen corresponding path program 1 times [2025-04-30 10:44:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:36,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906206906] [2025-04-30 10:44:36,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:36,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:36,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:36,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:36,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906206906] [2025-04-30 10:44:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906206906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:44:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139216355] [2025-04-30 10:44:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:36,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:44:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:36,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:44:36,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:36,636 INFO L87 Difference]: Start difference. First operand 729 states and 957 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:37,095 INFO L93 Difference]: Finished difference Result 982 states and 1259 transitions. [2025-04-30 10:44:37,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:44:37,096 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:37,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:37,098 INFO L225 Difference]: With dead ends: 982 [2025-04-30 10:44:37,099 INFO L226 Difference]: Without dead ends: 982 [2025-04-30 10:44:37,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:37,099 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 395 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:37,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1407 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-04-30 10:44:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 759. [2025-04-30 10:44:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 673 states have (on average 1.3774145616641902) internal successors, (927), 728 states have internal predecessors, (927), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2025-04-30 10:44:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 999 transitions. [2025-04-30 10:44:37,113 INFO L79 Accepts]: Start accepts. Automaton has 759 states and 999 transitions. Word has length 51 [2025-04-30 10:44:37,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:37,113 INFO L485 AbstractCegarLoop]: Abstraction has 759 states and 999 transitions. [2025-04-30 10:44:37,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:37,113 INFO L278 IsEmpty]: Start isEmpty. Operand 759 states and 999 transitions. [2025-04-30 10:44:37,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:37,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:37,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:37,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-30 10:44:37,114 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:37,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 455878053, now seen corresponding path program 1 times [2025-04-30 10:44:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:37,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103929469] [2025-04-30 10:44:37,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:37,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:37,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:37,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:37,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:37,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103929469] [2025-04-30 10:44:37,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103929469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:37,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:44:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747417013] [2025-04-30 10:44:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:37,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:37,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:37,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:37,556 INFO L87 Difference]: Start difference. First operand 759 states and 999 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:38,034 INFO L93 Difference]: Finished difference Result 1350 states and 1789 transitions. [2025-04-30 10:44:38,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:38,035 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:38,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:38,039 INFO L225 Difference]: With dead ends: 1350 [2025-04-30 10:44:38,039 INFO L226 Difference]: Without dead ends: 1350 [2025-04-30 10:44:38,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:44:38,039 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 373 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:38,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1057 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-04-30 10:44:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1141. [2025-04-30 10:44:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1011 states have (on average 1.3956478733926805) internal successors, (1411), 1088 states have internal predecessors, (1411), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-04-30 10:44:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1549 transitions. [2025-04-30 10:44:38,059 INFO L79 Accepts]: Start accepts. Automaton has 1141 states and 1549 transitions. Word has length 51 [2025-04-30 10:44:38,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:38,059 INFO L485 AbstractCegarLoop]: Abstraction has 1141 states and 1549 transitions. [2025-04-30 10:44:38,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,059 INFO L278 IsEmpty]: Start isEmpty. Operand 1141 states and 1549 transitions. [2025-04-30 10:44:38,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:38,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:38,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:38,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-30 10:44:38,060 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:38,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623425, now seen corresponding path program 1 times [2025-04-30 10:44:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:38,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299074777] [2025-04-30 10:44:38,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:38,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299074777] [2025-04-30 10:44:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299074777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:38,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787153350] [2025-04-30 10:44:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:38,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:38,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:38,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:38,207 INFO L87 Difference]: Start difference. First operand 1141 states and 1549 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:38,397 INFO L93 Difference]: Finished difference Result 1399 states and 1865 transitions. [2025-04-30 10:44:38,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:38,398 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:38,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:38,401 INFO L225 Difference]: With dead ends: 1399 [2025-04-30 10:44:38,401 INFO L226 Difference]: Without dead ends: 1399 [2025-04-30 10:44:38,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:38,402 INFO L437 NwaCegarLoop]: 223 mSDtfsCounter, 142 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:38,402 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1181 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-04-30 10:44:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1186. [2025-04-30 10:44:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1052 states have (on average 1.4011406844106464) internal successors, (1474), 1131 states have internal predecessors, (1474), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:44:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1618 transitions. [2025-04-30 10:44:38,419 INFO L79 Accepts]: Start accepts. Automaton has 1186 states and 1618 transitions. Word has length 51 [2025-04-30 10:44:38,419 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:38,419 INFO L485 AbstractCegarLoop]: Abstraction has 1186 states and 1618 transitions. [2025-04-30 10:44:38,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,419 INFO L278 IsEmpty]: Start isEmpty. Operand 1186 states and 1618 transitions. [2025-04-30 10:44:38,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:38,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:38,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:38,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-30 10:44:38,420 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:38,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623041, now seen corresponding path program 1 times [2025-04-30 10:44:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:38,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919171781] [2025-04-30 10:44:38,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:38,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:38,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:38,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919171781] [2025-04-30 10:44:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919171781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:38,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235349524] [2025-04-30 10:44:38,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:38,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:38,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:44:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:38,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-30 10:44:38,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:39,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:39,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:39,237 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 29 treesize of output 22 [2025-04-30 10:44:39,364 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:39,365 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 32 treesize of output 12 [2025-04-30 10:44:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:39,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235349524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2025-04-30 10:44:39,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283851959] [2025-04-30 10:44:39,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:39,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:44:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:39,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:44:39,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:39,372 INFO L87 Difference]: Start difference. First operand 1186 states and 1618 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:39,978 INFO L93 Difference]: Finished difference Result 1546 states and 2060 transitions. [2025-04-30 10:44:39,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:44:39,978 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:39,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:39,982 INFO L225 Difference]: With dead ends: 1546 [2025-04-30 10:44:39,982 INFO L226 Difference]: Without dead ends: 1546 [2025-04-30 10:44:39,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:44:39,983 INFO L437 NwaCegarLoop]: 265 mSDtfsCounter, 307 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:39,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2366 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:44:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-04-30 10:44:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1254. [2025-04-30 10:44:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1112 states have (on average 1.3965827338129497) internal successors, (1553), 1195 states have internal predecessors, (1553), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2025-04-30 10:44:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1709 transitions. [2025-04-30 10:44:40,003 INFO L79 Accepts]: Start accepts. Automaton has 1254 states and 1709 transitions. Word has length 51 [2025-04-30 10:44:40,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:40,004 INFO L485 AbstractCegarLoop]: Abstraction has 1254 states and 1709 transitions. [2025-04-30 10:44:40,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:40,004 INFO L278 IsEmpty]: Start isEmpty. Operand 1254 states and 1709 transitions. [2025-04-30 10:44:40,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:40,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:40,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:40,012 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-30 10:44:40,209 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,SelfDestructingSolverStorable42 [2025-04-30 10:44:40,209 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:40,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623042, now seen corresponding path program 1 times [2025-04-30 10:44:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:40,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527671101] [2025-04-30 10:44:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:40,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:40,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527671101] [2025-04-30 10:44:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527671101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:40,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234209020] [2025-04-30 10:44:40,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:40,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:40,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:40,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:44:40,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:40,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:40,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:40,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:40,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-30 10:44:40,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:40,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:44:41,058 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 11 treesize of output 7 [2025-04-30 10:44:41,064 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 11 treesize of output 7 [2025-04-30 10:44:41,203 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 23 treesize of output 11 [2025-04-30 10:44:41,208 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 25 treesize of output 20 [2025-04-30 10:44:41,386 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-30 10:44:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:41,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234209020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 25 [2025-04-30 10:44:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344251439] [2025-04-30 10:44:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:41,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:41,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:44:41,427 INFO L87 Difference]: Start difference. First operand 1254 states and 1709 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:42,080 INFO L93 Difference]: Finished difference Result 1522 states and 2025 transitions. [2025-04-30 10:44:42,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:44:42,080 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:42,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:42,085 INFO L225 Difference]: With dead ends: 1522 [2025-04-30 10:44:42,086 INFO L226 Difference]: Without dead ends: 1522 [2025-04-30 10:44:42,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:44:42,086 INFO L437 NwaCegarLoop]: 266 mSDtfsCounter, 310 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:42,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 2218 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:44:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-04-30 10:44:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1200. [2025-04-30 10:44:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1066 states have (on average 1.399624765478424) internal successors, (1492), 1145 states have internal predecessors, (1492), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:44:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1636 transitions. [2025-04-30 10:44:42,105 INFO L79 Accepts]: Start accepts. Automaton has 1200 states and 1636 transitions. Word has length 51 [2025-04-30 10:44:42,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:42,106 INFO L485 AbstractCegarLoop]: Abstraction has 1200 states and 1636 transitions. [2025-04-30 10:44:42,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,107 INFO L278 IsEmpty]: Start isEmpty. Operand 1200 states and 1636 transitions. [2025-04-30 10:44:42,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:42,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:42,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:42,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:42,312 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,SelfDestructingSolverStorable43 [2025-04-30 10:44:42,312 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:42,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1149776383, now seen corresponding path program 1 times [2025-04-30 10:44:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:42,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924716885] [2025-04-30 10:44:42,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:42,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:42,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:42,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:42,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924716885] [2025-04-30 10:44:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924716885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:44:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991372458] [2025-04-30 10:44:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:42,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:42,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:42,466 INFO L87 Difference]: Start difference. First operand 1200 states and 1636 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:42,694 INFO L93 Difference]: Finished difference Result 1414 states and 1881 transitions. [2025-04-30 10:44:42,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:44:42,695 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:42,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:42,698 INFO L225 Difference]: With dead ends: 1414 [2025-04-30 10:44:42,698 INFO L226 Difference]: Without dead ends: 1414 [2025-04-30 10:44:42,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:42,698 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 309 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:42,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1258 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-04-30 10:44:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1109. [2025-04-30 10:44:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 983 states have (on average 1.3865717192268565) internal successors, (1363), 1058 states have internal predecessors, (1363), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:44:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1495 transitions. [2025-04-30 10:44:42,717 INFO L79 Accepts]: Start accepts. Automaton has 1109 states and 1495 transitions. Word has length 51 [2025-04-30 10:44:42,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:42,717 INFO L485 AbstractCegarLoop]: Abstraction has 1109 states and 1495 transitions. [2025-04-30 10:44:42,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,717 INFO L278 IsEmpty]: Start isEmpty. Operand 1109 states and 1495 transitions. [2025-04-30 10:44:42,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:42,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:42,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:42,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-30 10:44:42,717 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:42,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1149775999, now seen corresponding path program 1 times [2025-04-30 10:44:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:42,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629439761] [2025-04-30 10:44:42,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:42,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:42,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:42,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:42,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629439761] [2025-04-30 10:44:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629439761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:42,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:44:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532270805] [2025-04-30 10:44:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:42,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:42,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:42,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:42,897 INFO L87 Difference]: Start difference. First operand 1109 states and 1495 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:43,123 INFO L93 Difference]: Finished difference Result 1355 states and 1798 transitions. [2025-04-30 10:44:43,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:43,123 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:43,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:43,126 INFO L225 Difference]: With dead ends: 1355 [2025-04-30 10:44:43,126 INFO L226 Difference]: Without dead ends: 1355 [2025-04-30 10:44:43,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:43,127 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 288 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:43,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1028 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-04-30 10:44:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1018. [2025-04-30 10:44:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 904 states have (on average 1.3938053097345133) internal successors, (1260), 973 states have internal predecessors, (1260), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-04-30 10:44:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1374 transitions. [2025-04-30 10:44:43,139 INFO L79 Accepts]: Start accepts. Automaton has 1018 states and 1374 transitions. Word has length 51 [2025-04-30 10:44:43,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:43,139 INFO L485 AbstractCegarLoop]: Abstraction has 1018 states and 1374 transitions. [2025-04-30 10:44:43,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,139 INFO L278 IsEmpty]: Start isEmpty. Operand 1018 states and 1374 transitions. [2025-04-30 10:44:43,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:44:43,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:43,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:44:43,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-30 10:44:43,139 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:43,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -432651062, now seen corresponding path program 1 times [2025-04-30 10:44:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:43,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647226936] [2025-04-30 10:44:43,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:43,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647226936] [2025-04-30 10:44:43,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647226936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:43,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104910525] [2025-04-30 10:44:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:43,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:43,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:43,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:43,278 INFO L87 Difference]: Start difference. First operand 1018 states and 1374 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:43,481 INFO L93 Difference]: Finished difference Result 1334 states and 1767 transitions. [2025-04-30 10:44:43,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:43,481 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-04-30 10:44:43,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:43,484 INFO L225 Difference]: With dead ends: 1334 [2025-04-30 10:44:43,484 INFO L226 Difference]: Without dead ends: 1334 [2025-04-30 10:44:43,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:43,487 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 160 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:43,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 801 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-04-30 10:44:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1128. [2025-04-30 10:44:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1002 states have (on average 1.3952095808383234) internal successors, (1398), 1077 states have internal predecessors, (1398), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:44:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1530 transitions. [2025-04-30 10:44:43,501 INFO L79 Accepts]: Start accepts. Automaton has 1128 states and 1530 transitions. Word has length 54 [2025-04-30 10:44:43,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:43,501 INFO L485 AbstractCegarLoop]: Abstraction has 1128 states and 1530 transitions. [2025-04-30 10:44:43,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,501 INFO L278 IsEmpty]: Start isEmpty. Operand 1128 states and 1530 transitions. [2025-04-30 10:44:43,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:44:43,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:43,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:44:43,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-30 10:44:43,503 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:43,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 376695564, now seen corresponding path program 1 times [2025-04-30 10:44:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:43,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637609523] [2025-04-30 10:44:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:43,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:43,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:43,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:43,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637609523] [2025-04-30 10:44:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637609523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:43,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97934095] [2025-04-30 10:44:43,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:43,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:43,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:44:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:43,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-30 10:44:43,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:44,130 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 11 treesize of output 7 [2025-04-30 10:44:44,173 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 27 treesize of output 22 [2025-04-30 10:44:44,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:44,346 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:44,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-04-30 10:44:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:44,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97934095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-04-30 10:44:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069280221] [2025-04-30 10:44:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:44,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:44,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:44,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:44:44,356 INFO L87 Difference]: Start difference. First operand 1128 states and 1530 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:44,689 INFO L93 Difference]: Finished difference Result 1336 states and 1768 transitions. [2025-04-30 10:44:44,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:44,689 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-04-30 10:44:44,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:44,692 INFO L225 Difference]: With dead ends: 1336 [2025-04-30 10:44:44,692 INFO L226 Difference]: Without dead ends: 1336 [2025-04-30 10:44:44,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:44:44,693 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 357 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:44,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 927 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-04-30 10:44:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1128. [2025-04-30 10:44:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1002 states have (on average 1.3952095808383234) internal successors, (1398), 1077 states have internal predecessors, (1398), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:44:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1530 transitions. [2025-04-30 10:44:44,711 INFO L79 Accepts]: Start accepts. Automaton has 1128 states and 1530 transitions. Word has length 54 [2025-04-30 10:44:44,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:44,711 INFO L485 AbstractCegarLoop]: Abstraction has 1128 states and 1530 transitions. [2025-04-30 10:44:44,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,711 INFO L278 IsEmpty]: Start isEmpty. Operand 1128 states and 1530 transitions. [2025-04-30 10:44:44,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:44:44,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:44,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:44:44,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:44,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:44,912 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:44,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -196507633, now seen corresponding path program 1 times [2025-04-30 10:44:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:44,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043656959] [2025-04-30 10:44:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:44,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:45,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043656959] [2025-04-30 10:44:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043656959] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:45,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054974432] [2025-04-30 10:44:45,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:45,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:45,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:44:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:45,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:45,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:45,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:45,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:44:45,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:45,538 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 19 treesize of output 1 [2025-04-30 10:44:45,574 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 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:44:45,628 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 21 treesize of output 9 [2025-04-30 10:44:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:45,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054974432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-04-30 10:44:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795092462] [2025-04-30 10:44:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:45,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:45,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:44:45,635 INFO L87 Difference]: Start difference. First operand 1128 states and 1530 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:45,929 INFO L93 Difference]: Finished difference Result 1438 states and 1901 transitions. [2025-04-30 10:44:45,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:45,929 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-04-30 10:44:45,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:45,932 INFO L225 Difference]: With dead ends: 1438 [2025-04-30 10:44:45,932 INFO L226 Difference]: Without dead ends: 1438 [2025-04-30 10:44:45,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:44:45,934 INFO L437 NwaCegarLoop]: 233 mSDtfsCounter, 302 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:45,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1757 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-04-30 10:44:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1211. [2025-04-30 10:44:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1077 states have (on average 1.4001857010213556) internal successors, (1508), 1156 states have internal predecessors, (1508), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:44:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1652 transitions. [2025-04-30 10:44:45,956 INFO L79 Accepts]: Start accepts. Automaton has 1211 states and 1652 transitions. Word has length 54 [2025-04-30 10:44:45,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:45,956 INFO L485 AbstractCegarLoop]: Abstraction has 1211 states and 1652 transitions. [2025-04-30 10:44:45,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:45,956 INFO L278 IsEmpty]: Start isEmpty. Operand 1211 states and 1652 transitions. [2025-04-30 10:44:45,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:44:45,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:45,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:44:45,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:44:46,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-30 10:44:46,157 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:46,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash 612838993, now seen corresponding path program 1 times [2025-04-30 10:44:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:46,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744509854] [2025-04-30 10:44:46,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:46,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:44:46,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:44:46,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:46,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744509854] [2025-04-30 10:44:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744509854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:44:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616733142] [2025-04-30 10:44:46,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:46,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:46,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:46,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:46,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:46,325 INFO L87 Difference]: Start difference. First operand 1211 states and 1652 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:46,560 INFO L93 Difference]: Finished difference Result 1424 states and 1896 transitions. [2025-04-30 10:44:46,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:46,561 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-04-30 10:44:46,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:46,563 INFO L225 Difference]: With dead ends: 1424 [2025-04-30 10:44:46,563 INFO L226 Difference]: Without dead ends: 1424 [2025-04-30 10:44:46,564 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:46,564 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 366 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:46,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 926 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-04-30 10:44:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1102. [2025-04-30 10:44:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 980 states have (on average 1.3989795918367347) internal successors, (1371), 1053 states have internal predecessors, (1371), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2025-04-30 10:44:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1497 transitions. [2025-04-30 10:44:46,576 INFO L79 Accepts]: Start accepts. Automaton has 1102 states and 1497 transitions. Word has length 54 [2025-04-30 10:44:46,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:46,577 INFO L485 AbstractCegarLoop]: Abstraction has 1102 states and 1497 transitions. [2025-04-30 10:44:46,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:46,577 INFO L278 IsEmpty]: Start isEmpty. Operand 1102 states and 1497 transitions. [2025-04-30 10:44:46,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:46,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:46,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:46,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-30 10:44:46,578 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:46,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 247032249, now seen corresponding path program 1 times [2025-04-30 10:44:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:46,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411739238] [2025-04-30 10:44:46,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:46,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:46,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:46,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:46,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:47,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411739238] [2025-04-30 10:44:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411739238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:47,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463541710] [2025-04-30 10:44:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:47,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:47,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:47,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:44:47,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:47,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:47,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:47,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:47,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:44:47,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:47,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:44:47,567 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 11 treesize of output 7 [2025-04-30 10:44:47,574 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 11 treesize of output 7 [2025-04-30 10:44:47,625 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 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-30 10:44:47,629 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 36 treesize of output 27 [2025-04-30 10:44:47,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:47,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 15 [2025-04-30 10:44:47,801 INFO L325 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-04-30 10:44:47,801 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 17 treesize of output 17 [2025-04-30 10:44:47,900 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-04-30 10:44:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:47,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463541710] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:48,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 29 [2025-04-30 10:44:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604710529] [2025-04-30 10:44:48,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:48,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:44:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:44:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:44:48,135 INFO L87 Difference]: Start difference. First operand 1102 states and 1497 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:49,844 INFO L93 Difference]: Finished difference Result 1985 states and 2588 transitions. [2025-04-30 10:44:49,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-30 10:44:49,844 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-04-30 10:44:49,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:49,847 INFO L225 Difference]: With dead ends: 1985 [2025-04-30 10:44:49,848 INFO L226 Difference]: Without dead ends: 1985 [2025-04-30 10:44:49,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=601, Invalid=4369, Unknown=0, NotChecked=0, Total=4970 [2025-04-30 10:44:49,850 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 1110 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:49,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2632 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:44:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-04-30 10:44:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1364. [2025-04-30 10:44:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1210 states have (on average 1.3958677685950414) internal successors, (1689), 1297 states have internal predecessors, (1689), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 37 states have call predecessors, (116), 58 states have call successors, (116) [2025-04-30 10:44:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1863 transitions. [2025-04-30 10:44:49,866 INFO L79 Accepts]: Start accepts. Automaton has 1364 states and 1863 transitions. Word has length 56 [2025-04-30 10:44:49,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:49,866 INFO L485 AbstractCegarLoop]: Abstraction has 1364 states and 1863 transitions. [2025-04-30 10:44:49,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:49,866 INFO L278 IsEmpty]: Start isEmpty. Operand 1364 states and 1863 transitions. [2025-04-30 10:44:49,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:49,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:49,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:49,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:50,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:50,071 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-04-30 10:44:50,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 247032248, now seen corresponding path program 1 times [2025-04-30 10:44:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:50,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100558089] [2025-04-30 10:44:50,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:50,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:44:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:50,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100558089] [2025-04-30 10:44:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100558089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:50,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439973704] [2025-04-30 10:44:50,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:50,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:50,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:44:50,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:50,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:50,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:50,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:50,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:44:50,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:50,610 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 11 treesize of output 7 [2025-04-30 10:44:50,647 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 0 case distinctions, treesize of input 27 treesize of output 22 [2025-04-30 10:44:50,704 INFO L325 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2025-04-30 10:44:50,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 23 [2025-04-30 10:44:54,851 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:54,852 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 32 treesize of output 12 [2025-04-30 10:44:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:54,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439973704] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:54,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2025-04-30 10:44:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763325081] [2025-04-30 10:44:54,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:54,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:44:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:44:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=438, Unknown=1, NotChecked=0, Total=506 [2025-04-30 10:44:54,929 INFO L87 Difference]: Start difference. First operand 1364 states and 1863 transitions. Second operand has 20 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:03,372 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:45:15,511 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:45:19,566 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:45:23,588 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15