./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:50:03,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:50:03,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:50:03,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:50:03,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:50:03,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:50:03,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:50:03,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:50:03,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:50:03,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:50:03,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:50:03,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:50:03,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:50:03,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:50:03,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:50:03,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:03,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:50:03,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:03,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:50:03,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:50:03,806 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-jdk21/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 ! call(reach_error())) ) 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 -> e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 [2025-01-09 04:50:04,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:50:04,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:50:04,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:50:04,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:50:04,131 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:50:04,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:50:05,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff069476/990160b30f054b47b4e8db544389e47c/FLAGdb49a6c54 [2025-01-09 04:50:05,732 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:50:05,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:50:05,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff069476/990160b30f054b47b4e8db544389e47c/FLAGdb49a6c54 [2025-01-09 04:50:06,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff069476/990160b30f054b47b4e8db544389e47c [2025-01-09 04:50:06,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:50:06,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:50:06,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:50:06,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:50:06,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:50:06,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06, skipping insertion in model container [2025-01-09 04:50:06,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:50:06,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2025-01-09 04:50:06,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:50:06,197 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:50:06,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2025-01-09 04:50:06,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:50:06,270 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:50:06,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06 WrapperNode [2025-01-09 04:50:06,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:50:06,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:50:06,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:50:06,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:50:06,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,314 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 559 [2025-01-09 04:50:06,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:50:06,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:50:06,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:50:06,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:50:06,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:50:06,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:50:06,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:50:06,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:50:06,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:50:06,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (1/1) ... [2025-01-09 04:50:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:50:06,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:50:06,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:50:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:50:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:50:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:50:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:50:06,474 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:50:06,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:50:06,900 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-01-09 04:50:06,901 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:50:06,911 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:50:06,912 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:50:06,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:06 BoogieIcfgContainer [2025-01-09 04:50:06,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:50:06,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:50:06,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:50:06,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:50:06,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:06" (1/3) ... [2025-01-09 04:50:06,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4675dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:06, skipping insertion in model container [2025-01-09 04:50:06,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:06" (2/3) ... [2025-01-09 04:50:06,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4675dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:06, skipping insertion in model container [2025-01-09 04:50:06,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:06" (3/3) ... [2025-01-09 04:50:06,921 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:50:06,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:50:06,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 123 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:50:06,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:50:06,986 INFO L333 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=LoopHeads, 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;@678a88c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:50:06,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:50:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:50:06,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:06,997 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, 1, 1, 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-01-09 04:50:06,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1503533793, now seen corresponding path program 1 times [2025-01-09 04:50:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168172313] [2025-01-09 04:50:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:07,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:50:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:50:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168172313] [2025-01-09 04:50:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168172313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795421750] [2025-01-09 04:50:07,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:07,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:07,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:07,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:07,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:07,514 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:07,765 INFO L93 Difference]: Finished difference Result 588 states and 943 transitions. [2025-01-09 04:50:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:50:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:07,786 INFO L225 Difference]: With dead ends: 588 [2025-01-09 04:50:07,786 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 04:50:07,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:07,794 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1055 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:07,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1117 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 04:50:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 186. [2025-01-09 04:50:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 270 transitions. [2025-01-09 04:50:07,849 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 270 transitions. Word has length 61 [2025-01-09 04:50:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:07,850 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 270 transitions. [2025-01-09 04:50:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 270 transitions. [2025-01-09 04:50:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:07,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:07,853 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, 1, 1, 1, 1, 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-01-09 04:50:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:50:07,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash -886934908, now seen corresponding path program 1 times [2025-01-09 04:50:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026156523] [2025-01-09 04:50:07,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:07,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:07,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:07,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026156523] [2025-01-09 04:50:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026156523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895296571] [2025-01-09 04:50:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:08,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:08,120 INFO L87 Difference]: Start difference. First operand 186 states and 270 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:08,289 INFO L93 Difference]: Finished difference Result 664 states and 1021 transitions. [2025-01-09 04:50:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:50:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:08,298 INFO L225 Difference]: With dead ends: 664 [2025-01-09 04:50:08,298 INFO L226 Difference]: Without dead ends: 562 [2025-01-09 04:50:08,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:08,299 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 607 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:08,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 760 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-09 04:50:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 292. [2025-01-09 04:50:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 438 transitions. [2025-01-09 04:50:08,333 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 438 transitions. Word has length 63 [2025-01-09 04:50:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:08,333 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 438 transitions. [2025-01-09 04:50:08,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 438 transitions. [2025-01-09 04:50:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:08,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:08,334 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, 1, 1, 1, 1, 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-01-09 04:50:08,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:50:08,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:08,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 497894544, now seen corresponding path program 1 times [2025-01-09 04:50:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093477921] [2025-01-09 04:50:08,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093477921] [2025-01-09 04:50:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093477921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:08,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19244245] [2025-01-09 04:50:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:08,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:08,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:08,582 INFO L87 Difference]: Start difference. First operand 292 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:08,686 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2025-01-09 04:50:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:50:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:08,689 INFO L225 Difference]: With dead ends: 765 [2025-01-09 04:50:08,689 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 04:50:08,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:08,690 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 686 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:08,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 748 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 04:50:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 443. [2025-01-09 04:50:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 677 transitions. [2025-01-09 04:50:08,702 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 677 transitions. Word has length 63 [2025-01-09 04:50:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 677 transitions. [2025-01-09 04:50:08,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 677 transitions. [2025-01-09 04:50:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:08,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:08,704 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, 1, 1, 1, 1, 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-01-09 04:50:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:50:08,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1329115962, now seen corresponding path program 1 times [2025-01-09 04:50:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774392489] [2025-01-09 04:50:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:08,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:08,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:08,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:08,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774392489] [2025-01-09 04:50:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774392489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:08,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626854958] [2025-01-09 04:50:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:08,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:08,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:08,758 INFO L87 Difference]: Start difference. First operand 443 states and 677 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:08,787 INFO L93 Difference]: Finished difference Result 1102 states and 1714 transitions. [2025-01-09 04:50:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:08,790 INFO L225 Difference]: With dead ends: 1102 [2025-01-09 04:50:08,790 INFO L226 Difference]: Without dead ends: 750 [2025-01-09 04:50:08,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:08,792 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 380 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-01-09 04:50:08,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 380 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-01-09 04:50:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 734. [2025-01-09 04:50:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1120 transitions. [2025-01-09 04:50:08,810 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1120 transitions. Word has length 63 [2025-01-09 04:50:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1120 transitions. [2025-01-09 04:50:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1120 transitions. [2025-01-09 04:50:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:08,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:08,811 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, 1, 1, 1, 1, 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-01-09 04:50:08,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:50:08,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:08,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1501695225, now seen corresponding path program 1 times [2025-01-09 04:50:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:08,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-01-09 04:50:08,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:08,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:08,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:08,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-01-09 04:50:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504104365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:09,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51059414] [2025-01-09 04:50:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:09,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:09,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:09,046 INFO L87 Difference]: Start difference. First operand 734 states and 1120 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:09,160 INFO L93 Difference]: Finished difference Result 1379 states and 2122 transitions. [2025-01-09 04:50:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:50:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:09,163 INFO L225 Difference]: With dead ends: 1379 [2025-01-09 04:50:09,164 INFO L226 Difference]: Without dead ends: 736 [2025-01-09 04:50:09,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:50:09,165 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 396 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:09,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 526 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-01-09 04:50:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2025-01-09 04:50:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1116 transitions. [2025-01-09 04:50:09,182 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1116 transitions. Word has length 63 [2025-01-09 04:50:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:09,182 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1116 transitions. [2025-01-09 04:50:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1116 transitions. [2025-01-09 04:50:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:09,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:09,184 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, 1, 1, 1, 1, 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-01-09 04:50:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:50:09,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1505725276, now seen corresponding path program 1 times [2025-01-09 04:50:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513858578] [2025-01-09 04:50:09,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:09,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:09,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:09,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:09,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513858578] [2025-01-09 04:50:09,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513858578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:09,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:09,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824366010] [2025-01-09 04:50:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:09,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:09,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:09,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:09,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:09,337 INFO L87 Difference]: Start difference. First operand 734 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:09,452 INFO L93 Difference]: Finished difference Result 1494 states and 2292 transitions. [2025-01-09 04:50:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:50:09,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:09,457 INFO L225 Difference]: With dead ends: 1494 [2025-01-09 04:50:09,457 INFO L226 Difference]: Without dead ends: 1309 [2025-01-09 04:50:09,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:09,458 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 652 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:09,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1062 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-01-09 04:50:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 928. [2025-01-09 04:50:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1417 transitions. [2025-01-09 04:50:09,482 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1417 transitions. Word has length 63 [2025-01-09 04:50:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1417 transitions. [2025-01-09 04:50:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1417 transitions. [2025-01-09 04:50:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:50:09,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:09,484 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, 1, 1, 1, 1, 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-01-09 04:50:09,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:50:09,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1830608528, now seen corresponding path program 1 times [2025-01-09 04:50:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:09,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552222602] [2025-01-09 04:50:09,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:09,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:50:09,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:50:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:09,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552222602] [2025-01-09 04:50:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552222602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818136224] [2025-01-09 04:50:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:09,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:50:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:50:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:50:09,745 INFO L87 Difference]: Start difference. First operand 928 states and 1417 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:09,826 INFO L93 Difference]: Finished difference Result 1688 states and 2593 transitions. [2025-01-09 04:50:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:50:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:50:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:09,831 INFO L225 Difference]: With dead ends: 1688 [2025-01-09 04:50:09,831 INFO L226 Difference]: Without dead ends: 1503 [2025-01-09 04:50:09,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:09,832 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 662 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:09,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 763 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-09 04:50:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1122. [2025-01-09 04:50:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1718 transitions. [2025-01-09 04:50:09,858 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1718 transitions. Word has length 63 [2025-01-09 04:50:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:09,858 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1718 transitions. [2025-01-09 04:50:09,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1718 transitions. [2025-01-09 04:50:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:50:09,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:09,859 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, 1, 1, 1, 1, 1, 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-01-09 04:50:09,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:50:09,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:09,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1584928427, now seen corresponding path program 1 times [2025-01-09 04:50:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687804899] [2025-01-09 04:50:09,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:09,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:50:09,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:50:09,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:09,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687804899] [2025-01-09 04:50:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687804899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778500390] [2025-01-09 04:50:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:09,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:09,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:09,939 INFO L87 Difference]: Start difference. First operand 1122 states and 1718 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:10,045 INFO L93 Difference]: Finished difference Result 2215 states and 3406 transitions. [2025-01-09 04:50:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:10,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:50:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:10,050 INFO L225 Difference]: With dead ends: 2215 [2025-01-09 04:50:10,050 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 04:50:10,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:10,053 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 455 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:10,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 91 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 04:50:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-01-09 04:50:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1695 transitions. [2025-01-09 04:50:10,073 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1695 transitions. Word has length 64 [2025-01-09 04:50:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:10,077 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1695 transitions. [2025-01-09 04:50:10,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1695 transitions. [2025-01-09 04:50:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:50:10,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:10,078 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, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:10,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:50:10,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -747879712, now seen corresponding path program 1 times [2025-01-09 04:50:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870189668] [2025-01-09 04:50:10,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:50:10,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:50:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870189668] [2025-01-09 04:50:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870189668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:10,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:10,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080259002] [2025-01-09 04:50:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:10,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:10,220 INFO L87 Difference]: Start difference. First operand 1122 states and 1695 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:10,317 INFO L93 Difference]: Finished difference Result 2203 states and 3346 transitions. [2025-01-09 04:50:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:10,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:50:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:10,320 INFO L225 Difference]: With dead ends: 2203 [2025-01-09 04:50:10,320 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 04:50:10,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:10,322 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 415 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:10,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 04:50:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-01-09 04:50:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1672 transitions. [2025-01-09 04:50:10,341 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1672 transitions. Word has length 65 [2025-01-09 04:50:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:10,341 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1672 transitions. [2025-01-09 04:50:10,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1672 transitions. [2025-01-09 04:50:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:50:10,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:10,342 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, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:50:10,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:10,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 431205441, now seen corresponding path program 1 times [2025-01-09 04:50:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615754127] [2025-01-09 04:50:10,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:50:10,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:50:10,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:10,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615754127] [2025-01-09 04:50:10,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615754127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:10,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:10,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:10,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099132812] [2025-01-09 04:50:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:10,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:10,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:10,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:10,418 INFO L87 Difference]: Start difference. First operand 1122 states and 1672 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:10,513 INFO L93 Difference]: Finished difference Result 2211 states and 3310 transitions. [2025-01-09 04:50:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:50:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:10,517 INFO L225 Difference]: With dead ends: 2211 [2025-01-09 04:50:10,517 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 04:50:10,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:10,519 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 431 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:10,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 99 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 04:50:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-01-09 04:50:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1649 transitions. [2025-01-09 04:50:10,560 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1649 transitions. Word has length 66 [2025-01-09 04:50:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:10,561 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1649 transitions. [2025-01-09 04:50:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1649 transitions. [2025-01-09 04:50:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:50:10,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:10,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:10,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:50:10,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1430381312, now seen corresponding path program 1 times [2025-01-09 04:50:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196775129] [2025-01-09 04:50:10,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:50:10,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:50:10,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:10,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196775129] [2025-01-09 04:50:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196775129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660948664] [2025-01-09 04:50:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:10,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:10,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:10,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:10,656 INFO L87 Difference]: Start difference. First operand 1122 states and 1649 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:10,800 INFO L93 Difference]: Finished difference Result 2207 states and 3260 transitions. [2025-01-09 04:50:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:50:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:10,804 INFO L225 Difference]: With dead ends: 2207 [2025-01-09 04:50:10,804 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 04:50:10,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:10,806 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 413 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:10,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 107 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 04:50:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-01-09 04:50:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1626 transitions. [2025-01-09 04:50:10,821 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1626 transitions. Word has length 67 [2025-01-09 04:50:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:10,821 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1626 transitions. [2025-01-09 04:50:10,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2025-01-09 04:50:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:50:10,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:10,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:10,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:50:10,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:10,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -654863315, now seen corresponding path program 1 times [2025-01-09 04:50:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155337465] [2025-01-09 04:50:10,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:10,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:50:10,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:50:10,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:10,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155337465] [2025-01-09 04:50:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155337465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:50:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885127931] [2025-01-09 04:50:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:50:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:11,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:50:11,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:11,140 INFO L87 Difference]: Start difference. First operand 1122 states and 1626 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:11,454 INFO L93 Difference]: Finished difference Result 3185 states and 4646 transitions. [2025-01-09 04:50:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:50:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:11,460 INFO L225 Difference]: With dead ends: 3185 [2025-01-09 04:50:11,460 INFO L226 Difference]: Without dead ends: 2136 [2025-01-09 04:50:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:50:11,462 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 654 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:11,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 463 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-01-09 04:50:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1122. [2025-01-09 04:50:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.449598572702944) internal successors, (1625), 1121 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1625 transitions. [2025-01-09 04:50:11,484 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1625 transitions. Word has length 68 [2025-01-09 04:50:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:11,484 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1625 transitions. [2025-01-09 04:50:11,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1625 transitions. [2025-01-09 04:50:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:50:11,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:11,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:50:11,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1389072061, now seen corresponding path program 1 times [2025-01-09 04:50:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288230681] [2025-01-09 04:50:11,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:50:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:50:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:11,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288230681] [2025-01-09 04:50:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288230681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:11,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:50:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670966262] [2025-01-09 04:50:11,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:11,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:11,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:11,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:11,826 INFO L87 Difference]: Start difference. First operand 1122 states and 1625 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:12,323 INFO L93 Difference]: Finished difference Result 3285 states and 4748 transitions. [2025-01-09 04:50:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:50:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:50:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:12,329 INFO L225 Difference]: With dead ends: 3285 [2025-01-09 04:50:12,330 INFO L226 Difference]: Without dead ends: 2272 [2025-01-09 04:50:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:12,332 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1008 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:12,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 504 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2025-01-09 04:50:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1144. [2025-01-09 04:50:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4461942257217848) internal successors, (1653), 1143 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1653 transitions. [2025-01-09 04:50:12,364 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1653 transitions. Word has length 69 [2025-01-09 04:50:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1653 transitions. [2025-01-09 04:50:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1653 transitions. [2025-01-09 04:50:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:50:12,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:12,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:50:12,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1521065783, now seen corresponding path program 1 times [2025-01-09 04:50:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216096578] [2025-01-09 04:50:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:50:12,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:50:12,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:12,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216096578] [2025-01-09 04:50:12,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216096578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:12,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:12,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:50:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900715504] [2025-01-09 04:50:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:12,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:50:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:12,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:50:12,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:50:12,625 INFO L87 Difference]: Start difference. First operand 1144 states and 1653 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:13,001 INFO L93 Difference]: Finished difference Result 3259 states and 4733 transitions. [2025-01-09 04:50:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:50:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:13,007 INFO L225 Difference]: With dead ends: 3259 [2025-01-09 04:50:13,007 INFO L226 Difference]: Without dead ends: 2215 [2025-01-09 04:50:13,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:50:13,009 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 599 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:13,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 491 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2025-01-09 04:50:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1122. [2025-01-09 04:50:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.447814451382694) internal successors, (1623), 1121 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1623 transitions. [2025-01-09 04:50:13,032 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1623 transitions. Word has length 69 [2025-01-09 04:50:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1623 transitions. [2025-01-09 04:50:13,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1623 transitions. [2025-01-09 04:50:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:50:13,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:13,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:50:13,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 770281693, now seen corresponding path program 1 times [2025-01-09 04:50:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906713173] [2025-01-09 04:50:13,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:13,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:50:13,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:50:13,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:13,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:13,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906713173] [2025-01-09 04:50:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906713173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:50:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743912979] [2025-01-09 04:50:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:13,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:50:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:13,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:50:13,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:50:13,270 INFO L87 Difference]: Start difference. First operand 1122 states and 1623 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:13,596 INFO L93 Difference]: Finished difference Result 3214 states and 4663 transitions. [2025-01-09 04:50:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:50:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:13,603 INFO L225 Difference]: With dead ends: 3214 [2025-01-09 04:50:13,603 INFO L226 Difference]: Without dead ends: 2200 [2025-01-09 04:50:13,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:50:13,606 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 636 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:13,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 413 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2025-01-09 04:50:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1122. [2025-01-09 04:50:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4433541480820695) internal successors, (1618), 1121 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1618 transitions. [2025-01-09 04:50:13,629 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1618 transitions. Word has length 69 [2025-01-09 04:50:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:13,629 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1618 transitions. [2025-01-09 04:50:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1618 transitions. [2025-01-09 04:50:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:50:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:13,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:13,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:50:13,631 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:13,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash -751317883, now seen corresponding path program 1 times [2025-01-09 04:50:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004164544] [2025-01-09 04:50:13,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:13,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:50:13,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:50:13,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:13,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004164544] [2025-01-09 04:50:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004164544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:50:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390831504] [2025-01-09 04:50:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:50:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:13,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:50:13,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:50:13,869 INFO L87 Difference]: Start difference. First operand 1122 states and 1618 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:14,292 INFO L93 Difference]: Finished difference Result 3244 states and 4698 transitions. [2025-01-09 04:50:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:50:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:14,299 INFO L225 Difference]: With dead ends: 3244 [2025-01-09 04:50:14,299 INFO L226 Difference]: Without dead ends: 2210 [2025-01-09 04:50:14,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:50:14,302 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 321 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:14,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 655 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2025-01-09 04:50:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1122. [2025-01-09 04:50:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.43978590544157) internal successors, (1614), 1121 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1614 transitions. [2025-01-09 04:50:14,323 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1614 transitions. Word has length 70 [2025-01-09 04:50:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:14,323 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1614 transitions. [2025-01-09 04:50:14,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1614 transitions. [2025-01-09 04:50:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:50:14,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:14,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:14,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:50:14,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:14,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -425050317, now seen corresponding path program 1 times [2025-01-09 04:50:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:14,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 04:50:14,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:14,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:50:14,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:50:14,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:14,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 04:50:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124239218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:50:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109718291] [2025-01-09 04:50:14,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:14,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:50:14,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:14,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:50:14,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:50:14,801 INFO L87 Difference]: Start difference. First operand 1122 states and 1614 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:15,261 INFO L93 Difference]: Finished difference Result 4571 states and 6654 transitions. [2025-01-09 04:50:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:15,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:50:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:15,271 INFO L225 Difference]: With dead ends: 4571 [2025-01-09 04:50:15,271 INFO L226 Difference]: Without dead ends: 4176 [2025-01-09 04:50:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:50:15,273 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 711 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:15,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1586 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2025-01-09 04:50:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 1101. [2025-01-09 04:50:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1100 states have (on average 1.44) internal successors, (1584), 1100 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1584 transitions. [2025-01-09 04:50:15,303 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1584 transitions. Word has length 71 [2025-01-09 04:50:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:15,303 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1584 transitions. [2025-01-09 04:50:15,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1584 transitions. [2025-01-09 04:50:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:50:15,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:15,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:50:15,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1237414452, now seen corresponding path program 1 times [2025-01-09 04:50:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457463569] [2025-01-09 04:50:15,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:15,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:15,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:50:15,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:50:15,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457463569] [2025-01-09 04:50:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457463569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:50:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139520675] [2025-01-09 04:50:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:16,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:16,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:16,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:16,137 INFO L87 Difference]: Start difference. First operand 1101 states and 1584 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:16,914 INFO L93 Difference]: Finished difference Result 4515 states and 6577 transitions. [2025-01-09 04:50:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:50:16,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:50:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:16,930 INFO L225 Difference]: With dead ends: 4515 [2025-01-09 04:50:16,930 INFO L226 Difference]: Without dead ends: 4145 [2025-01-09 04:50:16,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:16,932 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 789 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1586 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2025-01-09 04:50:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 1100. [2025-01-09 04:50:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 1.4367606915377615) internal successors, (1579), 1099 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1579 transitions. [2025-01-09 04:50:16,958 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1579 transitions. Word has length 71 [2025-01-09 04:50:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:16,958 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1579 transitions. [2025-01-09 04:50:16,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1579 transitions. [2025-01-09 04:50:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:50:16,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:16,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:16,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:50:16,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:16,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1749525204, now seen corresponding path program 1 times [2025-01-09 04:50:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71210310] [2025-01-09 04:50:16,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:50:17,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:50:17,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71210310] [2025-01-09 04:50:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71210310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:17,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:17,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:50:17,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800262495] [2025-01-09 04:50:17,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:17,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:50:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:17,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:50:17,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:17,449 INFO L87 Difference]: Start difference. First operand 1100 states and 1579 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:17,965 INFO L93 Difference]: Finished difference Result 2499 states and 3623 transitions. [2025-01-09 04:50:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:50:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:50:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:17,970 INFO L225 Difference]: With dead ends: 2499 [2025-01-09 04:50:17,970 INFO L226 Difference]: Without dead ends: 2114 [2025-01-09 04:50:17,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:50:17,971 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 561 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:17,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1430 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2025-01-09 04:50:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1083. [2025-01-09 04:50:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.4390018484288354) internal successors, (1557), 1082 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1557 transitions. [2025-01-09 04:50:17,984 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1557 transitions. Word has length 71 [2025-01-09 04:50:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:17,984 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1557 transitions. [2025-01-09 04:50:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1557 transitions. [2025-01-09 04:50:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:50:17,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:17,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:17,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:50:17,985 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:17,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -133954429, now seen corresponding path program 1 times [2025-01-09 04:50:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:17,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829840243] [2025-01-09 04:50:17,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:17,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:50:18,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:50:18,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:18,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829840243] [2025-01-09 04:50:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829840243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-01-09 04:50:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689217948] [2025-01-09 04:50:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:19,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:50:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:19,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:50:19,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:19,956 INFO L87 Difference]: Start difference. First operand 1083 states and 1557 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:22,579 INFO L93 Difference]: Finished difference Result 5545 states and 8075 transitions. [2025-01-09 04:50:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 04:50:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:50:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:22,588 INFO L225 Difference]: With dead ends: 5545 [2025-01-09 04:50:22,589 INFO L226 Difference]: Without dead ends: 5176 [2025-01-09 04:50:22,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 04:50:22,592 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1085 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 3006 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:22,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4731 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3006 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:50:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2025-01-09 04:50:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 1096. [2025-01-09 04:50:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1095 states have (on average 1.4365296803652967) internal successors, (1573), 1095 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1573 transitions. [2025-01-09 04:50:22,623 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1573 transitions. Word has length 72 [2025-01-09 04:50:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1573 transitions. [2025-01-09 04:50:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1573 transitions. [2025-01-09 04:50:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:50:22,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:22,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:50:22,625 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1545437633, now seen corresponding path program 1 times [2025-01-09 04:50:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525408810] [2025-01-09 04:50:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:50:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:50:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525408810] [2025-01-09 04:50:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525408810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482146832] [2025-01-09 04:50:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:22,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:50:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:22,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:50:22,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:50:22,709 INFO L87 Difference]: Start difference. First operand 1096 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:22,738 INFO L93 Difference]: Finished difference Result 2508 states and 3642 transitions. [2025-01-09 04:50:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:50:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:22,741 INFO L225 Difference]: With dead ends: 2508 [2025-01-09 04:50:22,741 INFO L226 Difference]: Without dead ends: 1499 [2025-01-09 04:50:22,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 04:50:22,743 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:22,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 353 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-01-09 04:50:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1488. [2025-01-09 04:50:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 1.433759246805649) internal successors, (2132), 1487 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2132 transitions. [2025-01-09 04:50:22,758 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2132 transitions. Word has length 72 [2025-01-09 04:50:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:22,758 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 2132 transitions. [2025-01-09 04:50:22,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2132 transitions. [2025-01-09 04:50:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:50:22,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:22,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:22,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:50:22,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:22,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -654506813, now seen corresponding path program 1 times [2025-01-09 04:50:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511911462] [2025-01-09 04:50:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:22,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:50:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:50:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511911462] [2025-01-09 04:50:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511911462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:50:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072530736] [2025-01-09 04:50:22,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:22,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:22,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:22,908 INFO L87 Difference]: Start difference. First operand 1488 states and 2132 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:22,926 INFO L93 Difference]: Finished difference Result 1500 states and 2148 transitions. [2025-01-09 04:50:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:50:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:22,929 INFO L225 Difference]: With dead ends: 1500 [2025-01-09 04:50:22,929 INFO L226 Difference]: Without dead ends: 1498 [2025-01-09 04:50:22,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 04:50:22,932 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:22,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-01-09 04:50:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2025-01-09 04:50:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.4235136940547761) internal successors, (2131), 1497 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2131 transitions. [2025-01-09 04:50:22,945 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2131 transitions. Word has length 72 [2025-01-09 04:50:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2131 transitions. [2025-01-09 04:50:22,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2131 transitions. [2025-01-09 04:50:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:50:22,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:22,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:50:22,947 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:22,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1238915253, now seen corresponding path program 1 times [2025-01-09 04:50:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109256668] [2025-01-09 04:50:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:22,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:50:22,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:50:22,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109256668] [2025-01-09 04:50:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109256668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:23,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:50:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116163108] [2025-01-09 04:50:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:23,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:50:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:23,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:50:23,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:23,377 INFO L87 Difference]: Start difference. First operand 1498 states and 2131 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:23,848 INFO L93 Difference]: Finished difference Result 3466 states and 4968 transitions. [2025-01-09 04:50:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:50:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:50:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:23,852 INFO L225 Difference]: With dead ends: 3466 [2025-01-09 04:50:23,852 INFO L226 Difference]: Without dead ends: 2910 [2025-01-09 04:50:23,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:50:23,854 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 656 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:23,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1278 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-01-09 04:50:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1479. [2025-01-09 04:50:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1478 states have (on average 1.4255751014884979) internal successors, (2107), 1478 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2107 transitions. [2025-01-09 04:50:23,875 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2107 transitions. Word has length 73 [2025-01-09 04:50:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:23,875 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2107 transitions. [2025-01-09 04:50:23,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2107 transitions. [2025-01-09 04:50:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:50:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:23,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:50:23,877 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 578501654, now seen corresponding path program 1 times [2025-01-09 04:50:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112599791] [2025-01-09 04:50:23,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:23,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:50:23,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:50:23,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:23,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112599791] [2025-01-09 04:50:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112599791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412225828] [2025-01-09 04:50:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:23,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:23,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:23,967 INFO L87 Difference]: Start difference. First operand 1479 states and 2107 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:24,149 INFO L93 Difference]: Finished difference Result 4921 states and 7107 transitions. [2025-01-09 04:50:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:50:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:24,155 INFO L225 Difference]: With dead ends: 4921 [2025-01-09 04:50:24,155 INFO L226 Difference]: Without dead ends: 3510 [2025-01-09 04:50:24,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:24,158 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 716 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:24,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 274 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2025-01-09 04:50:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3198. [2025-01-09 04:50:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3197 states have (on average 1.4310290897716609) internal successors, (4575), 3197 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4575 transitions. [2025-01-09 04:50:24,220 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4575 transitions. Word has length 97 [2025-01-09 04:50:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:24,221 INFO L471 AbstractCegarLoop]: Abstraction has 3198 states and 4575 transitions. [2025-01-09 04:50:24,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4575 transitions. [2025-01-09 04:50:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:50:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:24,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:50:24,222 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1001070108, now seen corresponding path program 1 times [2025-01-09 04:50:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087403873] [2025-01-09 04:50:24,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:50:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:50:24,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:24,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087403873] [2025-01-09 04:50:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087403873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138437184] [2025-01-09 04:50:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:24,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:24,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:24,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:24,308 INFO L87 Difference]: Start difference. First operand 3198 states and 4575 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:24,524 INFO L93 Difference]: Finished difference Result 11566 states and 16743 transitions. [2025-01-09 04:50:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:50:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:24,539 INFO L225 Difference]: With dead ends: 11566 [2025-01-09 04:50:24,539 INFO L226 Difference]: Without dead ends: 8436 [2025-01-09 04:50:24,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:24,544 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 801 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:24,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 276 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2025-01-09 04:50:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 6946. [2025-01-09 04:50:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6946 states, 6945 states have (on average 1.431965442764579) internal successors, (9945), 6945 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 9945 transitions. [2025-01-09 04:50:24,621 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 9945 transitions. Word has length 97 [2025-01-09 04:50:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:24,621 INFO L471 AbstractCegarLoop]: Abstraction has 6946 states and 9945 transitions. [2025-01-09 04:50:24,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 9945 transitions. [2025-01-09 04:50:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:50:24,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:24,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:24,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:50:24,623 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1832318814, now seen corresponding path program 1 times [2025-01-09 04:50:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863972677] [2025-01-09 04:50:24,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:24,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:50:24,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:50:24,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:24,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863972677] [2025-01-09 04:50:24,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863972677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:24,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:24,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185453427] [2025-01-09 04:50:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:24,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:24,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:24,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:24,709 INFO L87 Difference]: Start difference. First operand 6946 states and 9945 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:24,946 INFO L93 Difference]: Finished difference Result 20126 states and 29083 transitions. [2025-01-09 04:50:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:50:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:24,968 INFO L225 Difference]: With dead ends: 20126 [2025-01-09 04:50:24,969 INFO L226 Difference]: Without dead ends: 13248 [2025-01-09 04:50:24,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:24,977 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 658 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:24,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 339 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13248 states. [2025-01-09 04:50:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13248 to 10636. [2025-01-09 04:50:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10636 states, 10635 states have (on average 1.435543018335684) internal successors, (15267), 10635 states have internal predecessors, (15267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 15267 transitions. [2025-01-09 04:50:25,173 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 15267 transitions. Word has length 97 [2025-01-09 04:50:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:25,173 INFO L471 AbstractCegarLoop]: Abstraction has 10636 states and 15267 transitions. [2025-01-09 04:50:25,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 15267 transitions. [2025-01-09 04:50:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:50:25,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:25,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:25,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:50:25,177 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:25,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 909226558, now seen corresponding path program 1 times [2025-01-09 04:50:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786100620] [2025-01-09 04:50:25,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:25,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:50:25,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:50:25,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:25,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786100620] [2025-01-09 04:50:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786100620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:25,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166467453] [2025-01-09 04:50:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:25,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:25,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:25,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,277 INFO L87 Difference]: Start difference. First operand 10636 states and 15267 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:25,333 INFO L93 Difference]: Finished difference Result 18776 states and 26973 transitions. [2025-01-09 04:50:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:50:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:25,354 INFO L225 Difference]: With dead ends: 18776 [2025-01-09 04:50:25,354 INFO L226 Difference]: Without dead ends: 10153 [2025-01-09 04:50:25,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,366 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 65 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:25,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 320 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-01-09 04:50:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 10151. [2025-01-09 04:50:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10151 states, 10150 states have (on average 1.421576354679803) internal successors, (14429), 10150 states have internal predecessors, (14429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10151 states to 10151 states and 14429 transitions. [2025-01-09 04:50:25,498 INFO L78 Accepts]: Start accepts. Automaton has 10151 states and 14429 transitions. Word has length 97 [2025-01-09 04:50:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 10151 states and 14429 transitions. [2025-01-09 04:50:25,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10151 states and 14429 transitions. [2025-01-09 04:50:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:50:25,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:25,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:25,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:50:25,502 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1634569540, now seen corresponding path program 1 times [2025-01-09 04:50:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206565993] [2025-01-09 04:50:25,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:50:25,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:50:25,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:25,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:50:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:25,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206565993] [2025-01-09 04:50:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206565993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:25,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453709077] [2025-01-09 04:50:25,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:25,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:25,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:25,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,595 INFO L87 Difference]: Start difference. First operand 10151 states and 14429 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:25,648 INFO L93 Difference]: Finished difference Result 19331 states and 27415 transitions. [2025-01-09 04:50:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:25,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 04:50:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:25,665 INFO L225 Difference]: With dead ends: 19331 [2025-01-09 04:50:25,666 INFO L226 Difference]: Without dead ends: 9262 [2025-01-09 04:50:25,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,675 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:25,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2025-01-09 04:50:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8990. [2025-01-09 04:50:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8990 states, 8989 states have (on average 1.4049393703415285) internal successors, (12629), 8989 states have internal predecessors, (12629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 12629 transitions. [2025-01-09 04:50:25,775 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 12629 transitions. Word has length 121 [2025-01-09 04:50:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 8990 states and 12629 transitions. [2025-01-09 04:50:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 12629 transitions. [2025-01-09 04:50:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:50:25,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:25,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:50:25,778 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:25,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 264130244, now seen corresponding path program 1 times [2025-01-09 04:50:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044642379] [2025-01-09 04:50:25,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:50:25,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:50:25,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:25,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:50:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044642379] [2025-01-09 04:50:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044642379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150814020] [2025-01-09 04:50:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:25,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:25,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,893 INFO L87 Difference]: Start difference. First operand 8990 states and 12629 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:25,931 INFO L93 Difference]: Finished difference Result 17024 states and 23835 transitions. [2025-01-09 04:50:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 04:50:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:25,945 INFO L225 Difference]: With dead ends: 17024 [2025-01-09 04:50:25,945 INFO L226 Difference]: Without dead ends: 8110 [2025-01-09 04:50:25,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:25,954 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 54 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:25,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states. [2025-01-09 04:50:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 7856. [2025-01-09 04:50:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7856 states, 7855 states have (on average 1.3831954169318905) internal successors, (10865), 7855 states have internal predecessors, (10865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7856 states to 7856 states and 10865 transitions. [2025-01-09 04:50:26,032 INFO L78 Accepts]: Start accepts. Automaton has 7856 states and 10865 transitions. Word has length 122 [2025-01-09 04:50:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 7856 states and 10865 transitions. [2025-01-09 04:50:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 7856 states and 10865 transitions. [2025-01-09 04:50:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 04:50:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:26,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:50:26,035 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1753192703, now seen corresponding path program 1 times [2025-01-09 04:50:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249759690] [2025-01-09 04:50:26,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 04:50:26,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 04:50:26,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:50:26,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:26,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249759690] [2025-01-09 04:50:26,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:26,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:26,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730468462] [2025-01-09 04:50:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:26,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:26,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:26,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:26,124 INFO L87 Difference]: Start difference. First operand 7856 states and 10865 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:26,170 INFO L93 Difference]: Finished difference Result 22492 states and 30923 transitions. [2025-01-09 04:50:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-01-09 04:50:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:26,196 INFO L225 Difference]: With dead ends: 22492 [2025-01-09 04:50:26,196 INFO L226 Difference]: Without dead ends: 14712 [2025-01-09 04:50:26,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:26,209 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 47 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:26,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 316 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14712 states. [2025-01-09 04:50:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14712 to 13534. [2025-01-09 04:50:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13534 states, 13533 states have (on average 1.3638513263873495) internal successors, (18457), 13533 states have internal predecessors, (18457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13534 states to 13534 states and 18457 transitions. [2025-01-09 04:50:26,357 INFO L78 Accepts]: Start accepts. Automaton has 13534 states and 18457 transitions. Word has length 123 [2025-01-09 04:50:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:26,358 INFO L471 AbstractCegarLoop]: Abstraction has 13534 states and 18457 transitions. [2025-01-09 04:50:26,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13534 states and 18457 transitions. [2025-01-09 04:50:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:50:26,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:26,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:26,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:50:26,360 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175903, now seen corresponding path program 1 times [2025-01-09 04:50:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645237743] [2025-01-09 04:50:26,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:50:26,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:50:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645237743] [2025-01-09 04:50:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645237743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:26,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:26,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:26,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361572103] [2025-01-09 04:50:26,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:26,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:26,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:26,440 INFO L87 Difference]: Start difference. First operand 13534 states and 18457 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:26,536 INFO L93 Difference]: Finished difference Result 23638 states and 32180 transitions. [2025-01-09 04:50:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:50:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:26,551 INFO L225 Difference]: With dead ends: 23638 [2025-01-09 04:50:26,551 INFO L226 Difference]: Without dead ends: 10180 [2025-01-09 04:50:26,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:26,561 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 69 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:26,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10180 states. [2025-01-09 04:50:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10180 to 10010. [2025-01-09 04:50:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10010 states, 10009 states have (on average 1.3404935557997801) internal successors, (13417), 10009 states have internal predecessors, (13417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 13417 transitions. [2025-01-09 04:50:26,662 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 13417 transitions. Word has length 124 [2025-01-09 04:50:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:26,662 INFO L471 AbstractCegarLoop]: Abstraction has 10010 states and 13417 transitions. [2025-01-09 04:50:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 13417 transitions. [2025-01-09 04:50:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:50:26,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:26,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:26,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:50:26,664 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:26,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1219450999, now seen corresponding path program 1 times [2025-01-09 04:50:26,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:26,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048749306] [2025-01-09 04:50:26,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:26,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:26,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:50:26,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:50:26,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:26,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:27,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048749306] [2025-01-09 04:50:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048749306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:50:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780745108] [2025-01-09 04:50:27,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:27,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:27,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:50:27,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:50:27,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:50:27,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:50:27,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:50:27,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:50:27,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:50:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:28,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:50:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780745108] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:50:29,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:50:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 33 [2025-01-09 04:50:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427413136] [2025-01-09 04:50:29,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:50:29,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 04:50:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:29,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 04:50:29,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:50:29,661 INFO L87 Difference]: Start difference. First operand 10010 states and 13417 transitions. Second operand has 34 states, 34 states have (on average 9.735294117647058) internal successors, (331), 33 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:37,715 INFO L93 Difference]: Finished difference Result 126062 states and 167569 transitions. [2025-01-09 04:50:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-01-09 04:50:37,715 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 9.735294117647058) internal successors, (331), 33 states have internal predecessors, (331), 0 states have call successors, (0), 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 124 [2025-01-09 04:50:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:37,930 INFO L225 Difference]: With dead ends: 126062 [2025-01-09 04:50:37,930 INFO L226 Difference]: Without dead ends: 116160 [2025-01-09 04:50:37,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10677 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4380, Invalid=27482, Unknown=0, NotChecked=0, Total=31862 [2025-01-09 04:50:37,981 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 5361 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5361 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:37,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5361 Valid, 2265 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 3003 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:50:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116160 states. [2025-01-09 04:50:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116160 to 76112. [2025-01-09 04:50:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76112 states, 76111 states have (on average 1.3320544993496342) internal successors, (101384), 76111 states have internal predecessors, (101384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76112 states to 76112 states and 101384 transitions. [2025-01-09 04:50:39,315 INFO L78 Accepts]: Start accepts. Automaton has 76112 states and 101384 transitions. Word has length 124 [2025-01-09 04:50:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:39,316 INFO L471 AbstractCegarLoop]: Abstraction has 76112 states and 101384 transitions. [2025-01-09 04:50:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.735294117647058) internal successors, (331), 33 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 76112 states and 101384 transitions. [2025-01-09 04:50:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:50:39,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:39,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:39,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:50:39,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:39,521 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -721088221, now seen corresponding path program 1 times [2025-01-09 04:50:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-01-09 04:50:39,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:39,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:50:39,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:50:39,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:39,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-01-09 04:50:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927300870] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:50:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592109325] [2025-01-09 04:50:39,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:50:39,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:50:39,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:50:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:50:40,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:50:40,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:40,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:40,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:50:40,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:50:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:40,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:50:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:41,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592109325] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:50:41,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:50:41,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-01-09 04:50:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183003904] [2025-01-09 04:50:41,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:50:41,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:50:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:41,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:50:41,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:50:41,926 INFO L87 Difference]: Start difference. First operand 76112 states and 101384 transitions. Second operand has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:43,670 INFO L93 Difference]: Finished difference Result 315094 states and 421255 transitions. [2025-01-09 04:50:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 04:50:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 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 125 [2025-01-09 04:50:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:44,087 INFO L225 Difference]: With dead ends: 315094 [2025-01-09 04:50:44,088 INFO L226 Difference]: Without dead ends: 239352 [2025-01-09 04:50:44,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=488, Invalid=1674, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 04:50:44,275 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1385 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:44,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1263 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:50:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239352 states. [2025-01-09 04:50:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239352 to 183885. [2025-01-09 04:50:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183885 states, 183884 states have (on average 1.3280655195666833) internal successors, (244210), 183884 states have internal predecessors, (244210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183885 states to 183885 states and 244210 transitions. [2025-01-09 04:50:46,508 INFO L78 Accepts]: Start accepts. Automaton has 183885 states and 244210 transitions. Word has length 125 [2025-01-09 04:50:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:46,509 INFO L471 AbstractCegarLoop]: Abstraction has 183885 states and 244210 transitions. [2025-01-09 04:50:46,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 25 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 183885 states and 244210 transitions. [2025-01-09 04:50:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:50:46,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:46,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:46,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:50:46,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:46,720 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:46,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2049259691, now seen corresponding path program 1 times [2025-01-09 04:50:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:46,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651409006] [2025-01-09 04:50:46,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:50:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:50:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651409006] [2025-01-09 04:50:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651409006] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:50:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948867892] [2025-01-09 04:50:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:50:47,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:50:47,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:50:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:50:47,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:50:47,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:47,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:50:47,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:50:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:48,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:50:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:49,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948867892] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:50:49,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:50:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2025-01-09 04:50:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598493548] [2025-01-09 04:50:49,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:50:49,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:50:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:49,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:50:49,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:50:49,220 INFO L87 Difference]: Start difference. First operand 183885 states and 244210 transitions. Second operand has 29 states, 29 states have (on average 10.689655172413794) internal successors, (310), 28 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:52,872 INFO L93 Difference]: Finished difference Result 620819 states and 824501 transitions. [2025-01-09 04:50:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 04:50:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.689655172413794) internal successors, (310), 28 states have internal predecessors, (310), 0 states have call successors, (0), 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 126 [2025-01-09 04:50:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:53,660 INFO L225 Difference]: With dead ends: 620819 [2025-01-09 04:50:53,660 INFO L226 Difference]: Without dead ends: 474733 [2025-01-09 04:50:53,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1115, Invalid=3715, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 04:50:53,861 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 3495 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:53,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 2259 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:50:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474733 states. [2025-01-09 04:50:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474733 to 183584. [2025-01-09 04:50:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183584 states, 183583 states have (on average 1.3284672328047804) internal successors, (243884), 183583 states have internal predecessors, (243884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183584 states to 183584 states and 243884 transitions. [2025-01-09 04:50:57,867 INFO L78 Accepts]: Start accepts. Automaton has 183584 states and 243884 transitions. Word has length 126 [2025-01-09 04:50:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:57,867 INFO L471 AbstractCegarLoop]: Abstraction has 183584 states and 243884 transitions. [2025-01-09 04:50:57,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.689655172413794) internal successors, (310), 28 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 183584 states and 243884 transitions. [2025-01-09 04:50:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:50:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:57,873 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:50:57,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:50:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:50:58,074 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -749645095, now seen corresponding path program 1 times [2025-01-09 04:50:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576081458] [2025-01-09 04:50:58,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:58,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:50:58,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:50:58,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:58,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:50:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576081458] [2025-01-09 04:50:58,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576081458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:58,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881625865] [2025-01-09 04:50:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:58,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:58,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:58,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:58,120 INFO L87 Difference]: Start difference. First operand 183584 states and 243884 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:58,941 INFO L93 Difference]: Finished difference Result 333578 states and 444165 transitions. [2025-01-09 04:50:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:58,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 126 [2025-01-09 04:50:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:59,145 INFO L225 Difference]: With dead ends: 333578 [2025-01-09 04:50:59,145 INFO L226 Difference]: Without dead ends: 150343 [2025-01-09 04:50:59,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:59,274 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 97 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:59,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 176 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150343 states. [2025-01-09 04:51:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150343 to 150343. [2025-01-09 04:51:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150343 states, 150342 states have (on average 1.3188330606217824) internal successors, (198276), 150342 states have internal predecessors, (198276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150343 states to 150343 states and 198276 transitions. [2025-01-09 04:51:01,411 INFO L78 Accepts]: Start accepts. Automaton has 150343 states and 198276 transitions. Word has length 126 [2025-01-09 04:51:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 150343 states and 198276 transitions. [2025-01-09 04:51:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 150343 states and 198276 transitions. [2025-01-09 04:51:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:51:01,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:01,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:51:01,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:51:01,420 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1160670702, now seen corresponding path program 1 times [2025-01-09 04:51:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656055339] [2025-01-09 04:51:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:01,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:51:01,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:51:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656055339] [2025-01-09 04:51:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656055339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:51:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259501393] [2025-01-09 04:51:01,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:51:01,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:01,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:51:01,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:51:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:51:02,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:51:02,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:02,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:02,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:51:02,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:51:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:02,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:51:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259501393] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:51:06,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:51:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-01-09 04:51:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964674845] [2025-01-09 04:51:06,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:51:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:51:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:06,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:51:06,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:51:06,330 INFO L87 Difference]: Start difference. First operand 150343 states and 198276 transitions. Second operand has 26 states, 26 states have (on average 11.384615384615385) internal successors, (296), 25 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:09,138 INFO L93 Difference]: Finished difference Result 601697 states and 796261 transitions. [2025-01-09 04:51:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 04:51:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.384615384615385) internal successors, (296), 25 states have internal predecessors, (296), 0 states have call successors, (0), 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 126 [2025-01-09 04:51:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:10,330 INFO L225 Difference]: With dead ends: 601697 [2025-01-09 04:51:10,331 INFO L226 Difference]: Without dead ends: 451703 [2025-01-09 04:51:10,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 04:51:10,412 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 648 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:10,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1268 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:51:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451703 states. [2025-01-09 04:51:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451703 to 366949. [2025-01-09 04:51:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366949 states, 366948 states have (on average 1.3161755889117803) internal successors, (482968), 366948 states have internal predecessors, (482968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366949 states to 366949 states and 482968 transitions. [2025-01-09 04:51:15,524 INFO L78 Accepts]: Start accepts. Automaton has 366949 states and 482968 transitions. Word has length 126 [2025-01-09 04:51:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 366949 states and 482968 transitions. [2025-01-09 04:51:15,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.384615384615385) internal successors, (296), 25 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 366949 states and 482968 transitions. [2025-01-09 04:51:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:51:15,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:15,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:51:15,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:51:15,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 04:51:15,746 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:15,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1712381596, now seen corresponding path program 1 times [2025-01-09 04:51:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048740553] [2025-01-09 04:51:15,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:51:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:51:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048740553] [2025-01-09 04:51:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048740553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:51:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968951539] [2025-01-09 04:51:16,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:51:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:16,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:51:16,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:51:16,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:51:16,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:51:16,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:16,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:16,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:51:16,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:51:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:17,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:51:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968951539] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:51:18,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:51:18,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 27 [2025-01-09 04:51:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532734454] [2025-01-09 04:51:18,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:51:18,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:51:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:18,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:51:18,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:51:18,146 INFO L87 Difference]: Start difference. First operand 366949 states and 482968 transitions. Second operand has 28 states, 28 states have (on average 11.821428571428571) internal successors, (331), 27 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:23,293 INFO L93 Difference]: Finished difference Result 1026131 states and 1340638 transitions. [2025-01-09 04:51:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 04:51:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.821428571428571) internal successors, (331), 27 states have internal predecessors, (331), 0 states have call successors, (0), 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 127 [2025-01-09 04:51:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:25,520 INFO L225 Difference]: With dead ends: 1026131 [2025-01-09 04:51:25,521 INFO L226 Difference]: Without dead ends: 876137 [2025-01-09 04:51:25,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1639, Invalid=5671, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 04:51:25,636 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2444 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:25,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2444 Valid, 2283 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]