./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.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.8.1.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 d09ea01cef1d93b0c86c8a3dadfd601718ca81915e873154848504beefeee43f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:55:30,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:55:30,455 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:55:30,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:55:30,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:55:30,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:55:30,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:55:30,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:55:30,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:55:30,490 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:55:30,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:55:30,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:55:30,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:55:30,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:55:30,491 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:55:30,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:55:30,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:55:30,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:55:30,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:55:30,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:30,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:30,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:30,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:55:30,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:30,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:30,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:30,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:30,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:55:30,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:55:30,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:55:30,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:55:30,496 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 -> d09ea01cef1d93b0c86c8a3dadfd601718ca81915e873154848504beefeee43f [2025-01-09 04:55:30,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:55:30,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:55:30,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:55:30,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:55:30,771 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:55:30,772 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:55:32,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac58ceeed/2573f6ba53c143848a77457b146bad4f/FLAGe4404c3be [2025-01-09 04:55:32,458 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:55:32,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:55:32,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac58ceeed/2573f6ba53c143848a77457b146bad4f/FLAGe4404c3be [2025-01-09 04:55:32,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac58ceeed/2573f6ba53c143848a77457b146bad4f [2025-01-09 04:55:32,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:55:32,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:55:32,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:32,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:55:32,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:55:32,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:32" (1/1) ... [2025-01-09 04:55:32,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:32, skipping insertion in model container [2025-01-09 04:55:32,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:32" (1/1) ... [2025-01-09 04:55:32,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:55:32,793 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693] [2025-01-09 04:55:32,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:32,867 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:55:32,958 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693] [2025-01-09 04:55:32,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:33,008 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:55:33,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33 WrapperNode [2025-01-09 04:55:33,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:33,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:33,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:55:33,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:55:33,019 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:55:33" (1/1) ... [2025-01-09 04:55:33,038 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:55:33" (1/1) ... [2025-01-09 04:55:33,085 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1033 [2025-01-09 04:55:33,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:33,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:55:33,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:55:33,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:55:33,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,118 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:55:33,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:55:33,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:55:33,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:55:33,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:55:33,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (1/1) ... [2025-01-09 04:55:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:33,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:55:33,191 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:55:33,193 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:55:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:55:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:55:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:55:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:55:33,364 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:55:33,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:55:34,327 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-01-09 04:55:34,327 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:55:34,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:55:34,344 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:55:34,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:34 BoogieIcfgContainer [2025-01-09 04:55:34,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:55:34,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:55:34,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:55:34,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:55:34,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:55:32" (1/3) ... [2025-01-09 04:55:34,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a69c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:34, skipping insertion in model container [2025-01-09 04:55:34,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:33" (2/3) ... [2025-01-09 04:55:34,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a69c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:34, skipping insertion in model container [2025-01-09 04:55:34,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:34" (3/3) ... [2025-01-09 04:55:34,358 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:55:34,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:55:34,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 231 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:55:34,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:55:34,455 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;@52b52e11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:55:34,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:55:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 229 states have (on average 1.7685589519650655) internal successors, (405), 230 states have internal predecessors, (405), 0 states have call successors, (0), 0 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:55:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:55:34,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:34,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 96284054, now seen corresponding path program 1 times [2025-01-09 04:55:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426506774] [2025-01-09 04:55:34,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:34,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:55:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:55:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:35,524 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:55:35,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426506774] [2025-01-09 04:55:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426506774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:35,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:35,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316791279] [2025-01-09 04:55:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:35,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:35,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:35,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:35,559 INFO L87 Difference]: Start difference. First operand has 231 states, 229 states have (on average 1.7685589519650655) internal successors, (405), 230 states have internal predecessors, (405), 0 states have call successors, (0), 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 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:55:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:36,548 INFO L93 Difference]: Finished difference Result 1826 states and 2955 transitions. [2025-01-09 04:55:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:55:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:55:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:36,579 INFO L225 Difference]: With dead ends: 1826 [2025-01-09 04:55:36,579 INFO L226 Difference]: Without dead ends: 1705 [2025-01-09 04:55:36,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:55:36,588 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 3815 mSDsluCounter, 7214 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3815 SdHoareTripleChecker+Valid, 8216 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:36,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3815 Valid, 8216 Invalid, 570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:55:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-01-09 04:55:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 348. [2025-01-09 04:55:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.446685878962536) internal successors, (502), 347 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:55:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 502 transitions. [2025-01-09 04:55:36,658 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 502 transitions. Word has length 124 [2025-01-09 04:55:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:36,660 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 502 transitions. [2025-01-09 04:55:36,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:55:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 502 transitions. [2025-01-09 04:55:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:36,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:36,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:55:36,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:36,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1563387348, now seen corresponding path program 1 times [2025-01-09 04:55:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619340362] [2025-01-09 04:55:36,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:36,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619340362] [2025-01-09 04:55:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619340362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895024830] [2025-01-09 04:55:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:37,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:37,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:37,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:37,200 INFO L87 Difference]: Start difference. First operand 348 states and 502 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:37,643 INFO L93 Difference]: Finished difference Result 1960 states and 3067 transitions. [2025-01-09 04:55:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:37,654 INFO L225 Difference]: With dead ends: 1960 [2025-01-09 04:55:37,655 INFO L226 Difference]: Without dead ends: 1780 [2025-01-09 04:55:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:37,660 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 2723 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 4050 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:55:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-01-09 04:55:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 552. [2025-01-09 04:55:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.5027223230490019) internal successors, (828), 551 states have internal predecessors, (828), 0 states have call successors, (0), 0 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:55:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 828 transitions. [2025-01-09 04:55:37,701 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 828 transitions. Word has length 126 [2025-01-09 04:55:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 828 transitions. [2025-01-09 04:55:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 828 transitions. [2025-01-09 04:55:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:37,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:37,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:55:37,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:37,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 714482392, now seen corresponding path program 1 times [2025-01-09 04:55:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-01-09 04:55:37,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:37,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:37,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:38,082 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:55:38,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:38,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-01-09 04:55:38,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833704440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:38,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:38,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809391192] [2025-01-09 04:55:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:38,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:38,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:38,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:38,084 INFO L87 Difference]: Start difference. First operand 552 states and 828 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:38,475 INFO L93 Difference]: Finished difference Result 2164 states and 3393 transitions. [2025-01-09 04:55:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:38,486 INFO L225 Difference]: With dead ends: 2164 [2025-01-09 04:55:38,486 INFO L226 Difference]: Without dead ends: 1984 [2025-01-09 04:55:38,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:38,490 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 2890 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 3536 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:38,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 3536 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-01-09 04:55:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 840. [2025-01-09 04:55:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 1.535160905840286) internal successors, (1288), 839 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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:55:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1288 transitions. [2025-01-09 04:55:38,536 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1288 transitions. Word has length 126 [2025-01-09 04:55:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1288 transitions. [2025-01-09 04:55:38,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1288 transitions. [2025-01-09 04:55:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:38,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:38,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:55:38,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2024644258, now seen corresponding path program 1 times [2025-01-09 04:55:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528662292] [2025-01-09 04:55:38,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:38,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:38,898 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:55:38,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528662292] [2025-01-09 04:55:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528662292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:38,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:38,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106124034] [2025-01-09 04:55:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:38,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:38,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:38,901 INFO L87 Difference]: Start difference. First operand 840 states and 1288 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:39,268 INFO L93 Difference]: Finished difference Result 2358 states and 3703 transitions. [2025-01-09 04:55:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:39,277 INFO L225 Difference]: With dead ends: 2358 [2025-01-09 04:55:39,278 INFO L226 Difference]: Without dead ends: 2178 [2025-01-09 04:55:39,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:39,281 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 3488 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 3070 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:39,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 3070 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-01-09 04:55:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1034. [2025-01-09 04:55:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.546950629235237) internal successors, (1598), 1033 states have internal predecessors, (1598), 0 states have call successors, (0), 0 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:55:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1598 transitions. [2025-01-09 04:55:39,335 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1598 transitions. Word has length 126 [2025-01-09 04:55:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:39,335 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1598 transitions. [2025-01-09 04:55:39,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1598 transitions. [2025-01-09 04:55:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:39,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:39,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:55:39,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:39,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash -292095440, now seen corresponding path program 1 times [2025-01-09 04:55:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444541148] [2025-01-09 04:55:39,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:39,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:39,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:39,664 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:55:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444541148] [2025-01-09 04:55:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444541148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001927480] [2025-01-09 04:55:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:39,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:39,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:39,667 INFO L87 Difference]: Start difference. First operand 1034 states and 1598 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:40,052 INFO L93 Difference]: Finished difference Result 2547 states and 4005 transitions. [2025-01-09 04:55:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:40,062 INFO L225 Difference]: With dead ends: 2547 [2025-01-09 04:55:40,062 INFO L226 Difference]: Without dead ends: 2367 [2025-01-09 04:55:40,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:40,066 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 3813 mSDsluCounter, 2741 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3813 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:40,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3813 Valid, 3303 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-01-09 04:55:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1213. [2025-01-09 04:55:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.5544554455445545) internal successors, (1884), 1212 states have internal predecessors, (1884), 0 states have call successors, (0), 0 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:55:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1884 transitions. [2025-01-09 04:55:40,107 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1884 transitions. Word has length 126 [2025-01-09 04:55:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:40,107 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1884 transitions. [2025-01-09 04:55:40,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1884 transitions. [2025-01-09 04:55:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:40,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:40,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:55:40,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 344464438, now seen corresponding path program 1 times [2025-01-09 04:55:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541284055] [2025-01-09 04:55:40,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:40,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:40,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:40,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:40,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541284055] [2025-01-09 04:55:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541284055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821387613] [2025-01-09 04:55:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:40,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:40,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:40,416 INFO L87 Difference]: Start difference. First operand 1213 states and 1884 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:40,767 INFO L93 Difference]: Finished difference Result 2725 states and 4290 transitions. [2025-01-09 04:55:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:40,777 INFO L225 Difference]: With dead ends: 2725 [2025-01-09 04:55:40,778 INFO L226 Difference]: Without dead ends: 2545 [2025-01-09 04:55:40,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:40,780 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 3953 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3953 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:40,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3953 Valid, 3165 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2025-01-09 04:55:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1391. [2025-01-09 04:55:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 1.5604316546762589) internal successors, (2169), 1390 states have internal predecessors, (2169), 0 states have call successors, (0), 0 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:55:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2169 transitions. [2025-01-09 04:55:40,825 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2169 transitions. Word has length 126 [2025-01-09 04:55:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:40,826 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 2169 transitions. [2025-01-09 04:55:40,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2169 transitions. [2025-01-09 04:55:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:40,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:40,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:55:40,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:40,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1799008799, now seen corresponding path program 1 times [2025-01-09 04:55:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871033199] [2025-01-09 04:55:40,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:40,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:40,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:40,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:41,438 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:55:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871033199] [2025-01-09 04:55:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871033199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:41,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:41,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733969383] [2025-01-09 04:55:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:41,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:41,441 INFO L87 Difference]: Start difference. First operand 1391 states and 2169 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:41,931 INFO L93 Difference]: Finished difference Result 2552 states and 4024 transitions. [2025-01-09 04:55:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:41,937 INFO L225 Difference]: With dead ends: 2552 [2025-01-09 04:55:41,937 INFO L226 Difference]: Without dead ends: 1393 [2025-01-09 04:55:41,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:55:41,939 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 768 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:41,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1597 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-01-09 04:55:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1391. [2025-01-09 04:55:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 1.5553956834532374) internal successors, (2162), 1390 states have internal predecessors, (2162), 0 states have call successors, (0), 0 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:55:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2162 transitions. [2025-01-09 04:55:41,969 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2162 transitions. Word has length 126 [2025-01-09 04:55:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:41,970 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 2162 transitions. [2025-01-09 04:55:41,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2162 transitions. [2025-01-09 04:55:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:41,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:41,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:55:41,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:41,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2079312318, now seen corresponding path program 1 times [2025-01-09 04:55:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-01-09 04:55:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:41,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:42,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:42,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:42,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:42,074 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:55:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-01-09 04:55:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272993786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443035843] [2025-01-09 04:55:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:42,076 INFO L87 Difference]: Start difference. First operand 1391 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:42,138 INFO L93 Difference]: Finished difference Result 3625 states and 5715 transitions. [2025-01-09 04:55:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:42,148 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 04:55:42,149 INFO L226 Difference]: Without dead ends: 2466 [2025-01-09 04:55:42,151 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:55:42,152 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 733 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:55:42,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 733 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2025-01-09 04:55:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2438. [2025-01-09 04:55:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2437 states have (on average 1.5601148953631514) internal successors, (3802), 2437 states have internal predecessors, (3802), 0 states have call successors, (0), 0 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:55:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3802 transitions. [2025-01-09 04:55:42,206 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3802 transitions. Word has length 126 [2025-01-09 04:55:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:42,207 INFO L471 AbstractCegarLoop]: Abstraction has 2438 states and 3802 transitions. [2025-01-09 04:55:42,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3802 transitions. [2025-01-09 04:55:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:42,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:42,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:55:42,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:42,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 75972018, now seen corresponding path program 1 times [2025-01-09 04:55:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893166916] [2025-01-09 04:55:42,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:42,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:42,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:42,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:42,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:42,514 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:55:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893166916] [2025-01-09 04:55:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893166916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312558901] [2025-01-09 04:55:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:42,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:42,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:42,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:42,516 INFO L87 Difference]: Start difference. First operand 2438 states and 3802 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:42,884 INFO L93 Difference]: Finished difference Result 5239 states and 8225 transitions. [2025-01-09 04:55:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:42,904 INFO L225 Difference]: With dead ends: 5239 [2025-01-09 04:55:42,904 INFO L226 Difference]: Without dead ends: 4898 [2025-01-09 04:55:42,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:42,907 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 2947 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2947 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:42,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2947 Valid, 3658 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2025-01-09 04:55:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 2783. [2025-01-09 04:55:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2782 states have (on average 1.5625449317038103) internal successors, (4347), 2782 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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:55:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 4347 transitions. [2025-01-09 04:55:43,009 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 4347 transitions. Word has length 126 [2025-01-09 04:55:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:43,010 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 4347 transitions. [2025-01-09 04:55:43,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 4347 transitions. [2025-01-09 04:55:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:43,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:43,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:55:43,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:43,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1961504132, now seen corresponding path program 1 times [2025-01-09 04:55:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701508466] [2025-01-09 04:55:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:43,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:43,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:43,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:43,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:43,298 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:55:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701508466] [2025-01-09 04:55:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701508466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365538254] [2025-01-09 04:55:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:43,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:43,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:43,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:43,300 INFO L87 Difference]: Start difference. First operand 2783 states and 4347 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:43,681 INFO L93 Difference]: Finished difference Result 5584 states and 8770 transitions. [2025-01-09 04:55:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:43,700 INFO L225 Difference]: With dead ends: 5584 [2025-01-09 04:55:43,700 INFO L226 Difference]: Without dead ends: 5243 [2025-01-09 04:55:43,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:43,704 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 3051 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 4433 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2025-01-09 04:55:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 3133. [2025-01-09 04:55:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3132 states have (on average 1.5644955300127714) internal successors, (4900), 3132 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:55:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4900 transitions. [2025-01-09 04:55:43,832 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4900 transitions. Word has length 126 [2025-01-09 04:55:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:43,832 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4900 transitions. [2025-01-09 04:55:43,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4900 transitions. [2025-01-09 04:55:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:55:43,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:43,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:55:43,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 804381450, now seen corresponding path program 1 times [2025-01-09 04:55:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985903375] [2025-01-09 04:55:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:43,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:55:43,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:55:43,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:43,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:44,089 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:55:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985903375] [2025-01-09 04:55:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985903375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:44,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:55:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801236527] [2025-01-09 04:55:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:44,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:44,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:44,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:44,091 INFO L87 Difference]: Start difference. First operand 3133 states and 4900 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:44,433 INFO L93 Difference]: Finished difference Result 5944 states and 9339 transitions. [2025-01-09 04:55:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:55:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:55:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:44,448 INFO L225 Difference]: With dead ends: 5944 [2025-01-09 04:55:44,449 INFO L226 Difference]: Without dead ends: 5603 [2025-01-09 04:55:44,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:55:44,453 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 3391 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3391 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:44,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3391 Valid, 4616 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2025-01-09 04:55:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 3498. [2025-01-09 04:55:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.5661995996568487) internal successors, (5477), 3497 states have internal predecessors, (5477), 0 states have call successors, (0), 0 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:55:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5477 transitions. [2025-01-09 04:55:44,590 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 5477 transitions. Word has length 126 [2025-01-09 04:55:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:44,590 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 5477 transitions. [2025-01-09 04:55:44,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 5477 transitions. [2025-01-09 04:55:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:55:44,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:44,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:55:44,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 63392965, now seen corresponding path program 1 times [2025-01-09 04:55:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715462569] [2025-01-09 04:55:44,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:44,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:55:44,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:55:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:44,746 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:55:44,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715462569] [2025-01-09 04:55:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715462569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509767596] [2025-01-09 04:55:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:44,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:44,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:44,748 INFO L87 Difference]: Start difference. First operand 3498 states and 5477 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:45,080 INFO L93 Difference]: Finished difference Result 10285 states and 16189 transitions. [2025-01-09 04:55:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:45,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 04:55:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:45,097 INFO L225 Difference]: With dead ends: 10285 [2025-01-09 04:55:45,097 INFO L226 Difference]: Without dead ends: 6854 [2025-01-09 04:55:45,104 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:55:45,105 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1238 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:45,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 274 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:55:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2025-01-09 04:55:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6852. [2025-01-09 04:55:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.5676543570281711) internal successors, (10740), 6851 states have internal predecessors, (10740), 0 states have call successors, (0), 0 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:55:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10740 transitions. [2025-01-09 04:55:45,249 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10740 transitions. Word has length 127 [2025-01-09 04:55:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:45,249 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10740 transitions. [2025-01-09 04:55:45,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10740 transitions. [2025-01-09 04:55:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:55:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:45,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:55:45,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -715246153, now seen corresponding path program 1 times [2025-01-09 04:55:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526805972] [2025-01-09 04:55:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:45,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:55:45,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:55:45,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:45,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:45,405 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:55:45,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:45,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526805972] [2025-01-09 04:55:45,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526805972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:45,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:45,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:45,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475538135] [2025-01-09 04:55:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:45,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:45,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:45,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:45,408 INFO L87 Difference]: Start difference. First operand 6852 states and 10740 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:45,612 INFO L93 Difference]: Finished difference Result 13621 states and 21393 transitions. [2025-01-09 04:55:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:55:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:45,627 INFO L225 Difference]: With dead ends: 13621 [2025-01-09 04:55:45,628 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:45,637 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:55:45,638 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 804 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:45,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 205 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.5564151218800175) internal successors, (10663), 6851 states have internal predecessors, (10663), 0 states have call successors, (0), 0 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:55:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10663 transitions. [2025-01-09 04:55:45,803 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10663 transitions. Word has length 128 [2025-01-09 04:55:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10663 transitions. [2025-01-09 04:55:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10663 transitions. [2025-01-09 04:55:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 04:55:45,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:45,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:55:45,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1535233275, now seen corresponding path program 1 times [2025-01-09 04:55:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:45,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109882095] [2025-01-09 04:55:45,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:45,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 04:55:45,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 04:55:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:45,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:55:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109882095] [2025-01-09 04:55:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109882095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354726026] [2025-01-09 04:55:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:45,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:45,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:45,940 INFO L87 Difference]: Start difference. First operand 6852 states and 10663 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:46,130 INFO L93 Difference]: Finished difference Result 13609 states and 21225 transitions. [2025-01-09 04:55:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-01-09 04:55:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:46,147 INFO L225 Difference]: With dead ends: 13609 [2025-01-09 04:55:46,147 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:46,158 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:55:46,159 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 765 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:46,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 233 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.545175886731864) internal successors, (10586), 6851 states have internal predecessors, (10586), 0 states have call successors, (0), 0 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:55:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10586 transitions. [2025-01-09 04:55:46,270 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10586 transitions. Word has length 129 [2025-01-09 04:55:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:46,271 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10586 transitions. [2025-01-09 04:55:46,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10586 transitions. [2025-01-09 04:55:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 04:55:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:46,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:55:46,274 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -746894101, now seen corresponding path program 1 times [2025-01-09 04:55:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930391247] [2025-01-09 04:55:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:46,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:55:46,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:55:46,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:46,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:46,438 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:55:46,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:46,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930391247] [2025-01-09 04:55:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930391247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864356117] [2025-01-09 04:55:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:46,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:46,441 INFO L87 Difference]: Start difference. First operand 6852 states and 10586 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:46,634 INFO L93 Difference]: Finished difference Result 13613 states and 21076 transitions. [2025-01-09 04:55:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-01-09 04:55:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:46,647 INFO L225 Difference]: With dead ends: 13613 [2025-01-09 04:55:46,647 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:46,656 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:55:46,657 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 769 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:46,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 221 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.5339366515837105) internal successors, (10509), 6851 states have internal predecessors, (10509), 0 states have call successors, (0), 0 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:55:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10509 transitions. [2025-01-09 04:55:46,752 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10509 transitions. Word has length 130 [2025-01-09 04:55:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:46,753 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10509 transitions. [2025-01-09 04:55:46,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10509 transitions. [2025-01-09 04:55:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:55:46,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:46,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:46,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:55:46,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:46,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash -894772551, now seen corresponding path program 1 times [2025-01-09 04:55:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:46,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388438726] [2025-01-09 04:55:46,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:55:46,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:55:46,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:46,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388438726] [2025-01-09 04:55:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388438726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149749217] [2025-01-09 04:55:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:46,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:46,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:46,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:46,880 INFO L87 Difference]: Start difference. First operand 6852 states and 10509 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:47,066 INFO L93 Difference]: Finished difference Result 13625 states and 20936 transitions. [2025-01-09 04:55:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:55:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:47,079 INFO L225 Difference]: With dead ends: 13625 [2025-01-09 04:55:47,079 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:47,089 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:55:47,089 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 797 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:47,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 197 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.522697416435557) internal successors, (10432), 6851 states have internal predecessors, (10432), 0 states have call successors, (0), 0 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:55:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10432 transitions. [2025-01-09 04:55:47,178 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10432 transitions. Word has length 131 [2025-01-09 04:55:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:47,178 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10432 transitions. [2025-01-09 04:55:47,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10432 transitions. [2025-01-09 04:55:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:55:47,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:47,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:55:47,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:47,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 707180727, now seen corresponding path program 1 times [2025-01-09 04:55:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823928837] [2025-01-09 04:55:47,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:47,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:55:47,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:55:47,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:47,338 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:55:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823928837] [2025-01-09 04:55:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823928837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:47,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464737068] [2025-01-09 04:55:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:47,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:47,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:47,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:47,340 INFO L87 Difference]: Start difference. First operand 6852 states and 10432 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:55:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:47,535 INFO L93 Difference]: Finished difference Result 13633 states and 20792 transitions. [2025-01-09 04:55:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-01-09 04:55:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:47,549 INFO L225 Difference]: With dead ends: 13633 [2025-01-09 04:55:47,549 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:47,556 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:55:47,557 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 813 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:47,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 181 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.5114581812874033) internal successors, (10355), 6851 states have internal predecessors, (10355), 0 states have call successors, (0), 0 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:55:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10355 transitions. [2025-01-09 04:55:47,645 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10355 transitions. Word has length 132 [2025-01-09 04:55:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:47,645 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10355 transitions. [2025-01-09 04:55:47,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:55:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10355 transitions. [2025-01-09 04:55:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 04:55:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:47,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:55:47,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -72647047, now seen corresponding path program 1 times [2025-01-09 04:55:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651820938] [2025-01-09 04:55:47,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:47,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:55:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:55:47,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:47,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:47,777 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:55:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651820938] [2025-01-09 04:55:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651820938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299334728] [2025-01-09 04:55:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:47,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:47,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:47,780 INFO L87 Difference]: Start difference. First operand 6852 states and 10355 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:55:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:47,968 INFO L93 Difference]: Finished difference Result 13629 states and 20634 transitions. [2025-01-09 04:55:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-01-09 04:55:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:47,984 INFO L225 Difference]: With dead ends: 13629 [2025-01-09 04:55:47,984 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:47,992 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:55:47,993 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 795 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:47,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 189 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.5002189461392497) internal successors, (10278), 6851 states have internal predecessors, (10278), 0 states have call successors, (0), 0 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:55:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10278 transitions. [2025-01-09 04:55:48,164 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10278 transitions. Word has length 133 [2025-01-09 04:55:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:48,164 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10278 transitions. [2025-01-09 04:55:48,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:55:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10278 transitions. [2025-01-09 04:55:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 04:55:48,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:48,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:55:48,169 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1467277949, now seen corresponding path program 1 times [2025-01-09 04:55:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772063475] [2025-01-09 04:55:48,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:48,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 04:55:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 04:55:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:48,342 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:55:48,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772063475] [2025-01-09 04:55:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772063475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:48,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:48,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:48,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541965226] [2025-01-09 04:55:48,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:48,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:48,345 INFO L87 Difference]: Start difference. First operand 6852 states and 10278 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:55:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:48,557 INFO L93 Difference]: Finished difference Result 13617 states and 20468 transitions. [2025-01-09 04:55:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:48,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-01-09 04:55:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:48,573 INFO L225 Difference]: With dead ends: 13617 [2025-01-09 04:55:48,574 INFO L226 Difference]: Without dead ends: 6852 [2025-01-09 04:55:48,582 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:55:48,583 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 753 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:48,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 213 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:55:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2025-01-09 04:55:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852. [2025-01-09 04:55:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.4889797109910963) internal successors, (10201), 6851 states have internal predecessors, (10201), 0 states have call successors, (0), 0 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:55:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10201 transitions. [2025-01-09 04:55:48,699 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10201 transitions. Word has length 134 [2025-01-09 04:55:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:48,699 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10201 transitions. [2025-01-09 04:55:48,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:55:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10201 transitions. [2025-01-09 04:55:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 04:55:48,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:48,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:55:48,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1720431211, now seen corresponding path program 1 times [2025-01-09 04:55:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694896777] [2025-01-09 04:55:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:48,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 04:55:48,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 04:55:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:49,291 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:55:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694896777] [2025-01-09 04:55:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694896777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:49,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:55:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388090989] [2025-01-09 04:55:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:55:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:49,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:55:49,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:55:49,293 INFO L87 Difference]: Start difference. First operand 6852 states and 10201 transitions. Second operand has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:50,185 INFO L93 Difference]: Finished difference Result 20282 states and 30197 transitions. [2025-01-09 04:55:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:55:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-01-09 04:55:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:50,206 INFO L225 Difference]: With dead ends: 20282 [2025-01-09 04:55:50,206 INFO L226 Difference]: Without dead ends: 13658 [2025-01-09 04:55:50,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:55:50,217 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1276 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:50,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1092 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:55:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13658 states. [2025-01-09 04:55:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13658 to 6852. [2025-01-09 04:55:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.4876660341555976) internal successors, (10192), 6851 states have internal predecessors, (10192), 0 states have call successors, (0), 0 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:55:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10192 transitions. [2025-01-09 04:55:50,340 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10192 transitions. Word has length 135 [2025-01-09 04:55:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:50,342 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10192 transitions. [2025-01-09 04:55:50,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10192 transitions. [2025-01-09 04:55:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:55:50,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:50,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:55:50,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1294997924, now seen corresponding path program 1 times [2025-01-09 04:55:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278246437] [2025-01-09 04:55:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:50,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:55:50,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:55:50,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:50,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:50,874 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:55:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278246437] [2025-01-09 04:55:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278246437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:55:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139514682] [2025-01-09 04:55:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:50,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:55:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:50,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:55:50,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:55:50,877 INFO L87 Difference]: Start difference. First operand 6852 states and 10192 transitions. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:51,794 INFO L93 Difference]: Finished difference Result 20597 states and 30491 transitions. [2025-01-09 04:55:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:55:51,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-01-09 04:55:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:51,815 INFO L225 Difference]: With dead ends: 20597 [2025-01-09 04:55:51,816 INFO L226 Difference]: Without dead ends: 14153 [2025-01-09 04:55:51,824 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:55:51,825 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1384 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:51,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1203 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:55:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14153 states. [2025-01-09 04:55:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14153 to 7122. [2025-01-09 04:55:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7122 states, 7121 states have (on average 1.4881336890886112) internal successors, (10597), 7121 states have internal predecessors, (10597), 0 states have call successors, (0), 0 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:55:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 10597 transitions. [2025-01-09 04:55:51,959 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 10597 transitions. Word has length 136 [2025-01-09 04:55:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:51,959 INFO L471 AbstractCegarLoop]: Abstraction has 7122 states and 10597 transitions. [2025-01-09 04:55:51,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 10597 transitions. [2025-01-09 04:55:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:55:51,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:51,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:55:51,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:51,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1517119698, now seen corresponding path program 1 times [2025-01-09 04:55:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371325526] [2025-01-09 04:55:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:51,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:55:52,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:55:52,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:52,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:52,449 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:55:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371325526] [2025-01-09 04:55:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371325526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:55:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209015449] [2025-01-09 04:55:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:55:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:52,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:55:52,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:55:52,452 INFO L87 Difference]: Start difference. First operand 7122 states and 10597 transitions. Second operand has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:53,265 INFO L93 Difference]: Finished difference Result 20794 states and 30947 transitions. [2025-01-09 04:55:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:55:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-01-09 04:55:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:53,287 INFO L225 Difference]: With dead ends: 20794 [2025-01-09 04:55:53,288 INFO L226 Difference]: Without dead ends: 13943 [2025-01-09 04:55:53,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:55:53,298 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1426 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:53,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 895 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:55:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13943 states. [2025-01-09 04:55:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13943 to 7122. [2025-01-09 04:55:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7122 states, 7121 states have (on average 1.486869821654262) internal successors, (10588), 7121 states have internal predecessors, (10588), 0 states have call successors, (0), 0 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:55:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 10588 transitions. [2025-01-09 04:55:53,419 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 10588 transitions. Word has length 136 [2025-01-09 04:55:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:53,420 INFO L471 AbstractCegarLoop]: Abstraction has 7122 states and 10588 transitions. [2025-01-09 04:55:53,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 10588 transitions. [2025-01-09 04:55:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:55:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:53,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:55:53,423 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash 397308953, now seen corresponding path program 1 times [2025-01-09 04:55:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402202309] [2025-01-09 04:55:53,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:53,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:55:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:55:53,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:53,718 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:55:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:53,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402202309] [2025-01-09 04:55:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402202309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221391664] [2025-01-09 04:55:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:53,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:53,720 INFO L87 Difference]: Start difference. First operand 7122 states and 10588 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:55:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:54,186 INFO L93 Difference]: Finished difference Result 20261 states and 30204 transitions. [2025-01-09 04:55:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:55:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-09 04:55:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:54,207 INFO L225 Difference]: With dead ends: 20261 [2025-01-09 04:55:54,207 INFO L226 Difference]: Without dead ends: 13566 [2025-01-09 04:55:54,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:55:54,218 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 659 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:54,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 747 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:55:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13566 states. [2025-01-09 04:55:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13566 to 7122. [2025-01-09 04:55:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7122 states, 7121 states have (on average 1.4867293919393343) internal successors, (10587), 7121 states have internal predecessors, (10587), 0 states have call successors, (0), 0 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:55:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 10587 transitions. [2025-01-09 04:55:54,407 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 10587 transitions. Word has length 137 [2025-01-09 04:55:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 7122 states and 10587 transitions. [2025-01-09 04:55:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:55:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 10587 transitions. [2025-01-09 04:55:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:55:54,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:54,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:54,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:55:54,411 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 515629421, now seen corresponding path program 1 times [2025-01-09 04:55:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891100177] [2025-01-09 04:55:54,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:54,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:55:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:55:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:54,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891100177] [2025-01-09 04:55:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891100177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:54,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:54,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643896079] [2025-01-09 04:55:54,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:54,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:54,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:54,824 INFO L87 Difference]: Start difference. First operand 7122 states and 10587 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:55,624 INFO L93 Difference]: Finished difference Result 14389 states and 21371 transitions. [2025-01-09 04:55:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:55:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-01-09 04:55:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:55,636 INFO L225 Difference]: With dead ends: 14389 [2025-01-09 04:55:55,637 INFO L226 Difference]: Without dead ends: 7675 [2025-01-09 04:55:55,644 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:55:55,645 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 927 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:55,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1276 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:55:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7675 states. [2025-01-09 04:55:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7675 to 6852. [2025-01-09 04:55:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.486206393227266) internal successors, (10182), 6851 states have internal predecessors, (10182), 0 states have call successors, (0), 0 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:55:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10182 transitions. [2025-01-09 04:55:55,747 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10182 transitions. Word has length 138 [2025-01-09 04:55:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10182 transitions. [2025-01-09 04:55:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10182 transitions. [2025-01-09 04:55:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:55:55,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:55,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:55:55,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -68768199, now seen corresponding path program 1 times [2025-01-09 04:55:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323765278] [2025-01-09 04:55:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:55:55,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:55:55,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:55,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:56,163 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:55:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323765278] [2025-01-09 04:55:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323765278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349159312] [2025-01-09 04:55:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:56,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:56,165 INFO L87 Difference]: Start difference. First operand 6852 states and 10182 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:56,910 INFO L93 Difference]: Finished difference Result 20207 states and 30058 transitions. [2025-01-09 04:55:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:55:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-01-09 04:55:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:56,927 INFO L225 Difference]: With dead ends: 20207 [2025-01-09 04:55:56,928 INFO L226 Difference]: Without dead ends: 13628 [2025-01-09 04:55:56,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:55:56,937 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1184 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:56,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1412 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:55:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13628 states. [2025-01-09 04:55:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13628 to 6852. [2025-01-09 04:55:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.4846007882061012) internal successors, (10171), 6851 states have internal predecessors, (10171), 0 states have call successors, (0), 0 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:55:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10171 transitions. [2025-01-09 04:55:57,051 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10171 transitions. Word has length 138 [2025-01-09 04:55:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:57,052 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10171 transitions. [2025-01-09 04:55:57,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10171 transitions. [2025-01-09 04:55:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:55:57,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:57,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:55:57,054 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1141843042, now seen corresponding path program 1 times [2025-01-09 04:55:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043182449] [2025-01-09 04:55:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:55:57,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:55:57,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:57,414 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:55:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043182449] [2025-01-09 04:55:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043182449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:57,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585029138] [2025-01-09 04:55:57,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:57,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:57,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:57,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:57,416 INFO L87 Difference]: Start difference. First operand 6852 states and 10171 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:55:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:58,207 INFO L93 Difference]: Finished difference Result 20107 states and 29887 transitions. [2025-01-09 04:55:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:55:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 04:55:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:58,222 INFO L225 Difference]: With dead ends: 20107 [2025-01-09 04:55:58,223 INFO L226 Difference]: Without dead ends: 13583 [2025-01-09 04:55:58,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:55:58,230 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1171 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:58,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1385 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:55:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13583 states. [2025-01-09 04:55:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13583 to 6852. [2025-01-09 04:55:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.4827032549992702) internal successors, (10158), 6851 states have internal predecessors, (10158), 0 states have call successors, (0), 0 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:55:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10158 transitions. [2025-01-09 04:55:58,386 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10158 transitions. Word has length 139 [2025-01-09 04:55:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:58,386 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10158 transitions. [2025-01-09 04:55:58,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:55:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10158 transitions. [2025-01-09 04:55:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:55:58,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:58,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:58,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:55:58,389 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2085661092, now seen corresponding path program 1 times [2025-01-09 04:55:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942801978] [2025-01-09 04:55:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:58,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:55:58,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:55:58,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:58,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:58,685 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:55:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942801978] [2025-01-09 04:55:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942801978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145795807] [2025-01-09 04:55:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:58,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:58,688 INFO L87 Difference]: Start difference. First operand 6852 states and 10158 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:55:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:59,266 INFO L93 Difference]: Finished difference Result 19987 states and 29682 transitions. [2025-01-09 04:55:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:55:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-01-09 04:55:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:59,279 INFO L225 Difference]: With dead ends: 19987 [2025-01-09 04:55:59,279 INFO L226 Difference]: Without dead ends: 13528 [2025-01-09 04:55:59,286 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:55:59,287 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 722 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:59,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 888 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:55:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2025-01-09 04:55:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 6852. [2025-01-09 04:55:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6851 states have (on average 1.4805137936067727) internal successors, (10143), 6851 states have internal predecessors, (10143), 0 states have call successors, (0), 0 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:55:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10143 transitions. [2025-01-09 04:55:59,403 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 10143 transitions. Word has length 140 [2025-01-09 04:55:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:59,404 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 10143 transitions. [2025-01-09 04:55:59,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:55:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 10143 transitions. [2025-01-09 04:55:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:55:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:59,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:55:59,407 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1098028876, now seen corresponding path program 1 times [2025-01-09 04:55:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111307491] [2025-01-09 04:55:59,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:55:59,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:55:59,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:59,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:59,723 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:55:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111307491] [2025-01-09 04:55:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111307491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:55:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394275043] [2025-01-09 04:55:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:55:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:55:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:55:59,725 INFO L87 Difference]: Start difference. First operand 6852 states and 10143 transitions. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:00,372 INFO L93 Difference]: Finished difference Result 20163 states and 29900 transitions. [2025-01-09 04:56:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:56:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-01-09 04:56:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:00,385 INFO L225 Difference]: With dead ends: 20163 [2025-01-09 04:56:00,386 INFO L226 Difference]: Without dead ends: 13719 [2025-01-09 04:56:00,395 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:56:00,395 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1108 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:00,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1160 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:56:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13719 states. [2025-01-09 04:56:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13719 to 6903. [2025-01-09 04:56:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.4794262532599247) internal successors, (10211), 6902 states have internal predecessors, (10211), 0 states have call successors, (0), 0 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:56:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10211 transitions. [2025-01-09 04:56:00,492 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 10211 transitions. Word has length 141 [2025-01-09 04:56:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:00,493 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 10211 transitions. [2025-01-09 04:56:00,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 10211 transitions. [2025-01-09 04:56:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:00,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:00,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:56:00,495 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1957759301, now seen corresponding path program 1 times [2025-01-09 04:56:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-01-09 04:56:00,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:00,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:00,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:00,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:00,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:00,598 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:56:00,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-01-09 04:56:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915349724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:00,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:00,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312706191] [2025-01-09 04:56:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:00,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:00,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:00,600 INFO L87 Difference]: Start difference. First operand 6903 states and 10211 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:00,655 INFO L93 Difference]: Finished difference Result 19487 states and 29069 transitions. [2025-01-09 04:56:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:00,670 INFO L225 Difference]: With dead ends: 19487 [2025-01-09 04:56:00,671 INFO L226 Difference]: Without dead ends: 13043 [2025-01-09 04:56:00,680 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:56:00,681 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 149 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:00,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 637 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13043 states. [2025-01-09 04:56:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13043 to 12737. [2025-01-09 04:56:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12737 states, 12736 states have (on average 1.4780150753768844) internal successors, (18824), 12736 states have internal predecessors, (18824), 0 states have call successors, (0), 0 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:56:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 18824 transitions. [2025-01-09 04:56:00,834 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 18824 transitions. Word has length 142 [2025-01-09 04:56:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:00,835 INFO L471 AbstractCegarLoop]: Abstraction has 12737 states and 18824 transitions. [2025-01-09 04:56:00,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 18824 transitions. [2025-01-09 04:56:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:00,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:00,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:56:00,837 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2073179973, now seen corresponding path program 1 times [2025-01-09 04:56:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243774560] [2025-01-09 04:56:00,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:00,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:00,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:00,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:01,555 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:56:01,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243774560] [2025-01-09 04:56:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243774560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:56:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664112632] [2025-01-09 04:56:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:01,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:56:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:56:01,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:56:01,557 INFO L87 Difference]: Start difference. First operand 12737 states and 18824 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:02,261 INFO L93 Difference]: Finished difference Result 27856 states and 41255 transitions. [2025-01-09 04:56:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:56:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:02,289 INFO L225 Difference]: With dead ends: 27856 [2025-01-09 04:56:02,290 INFO L226 Difference]: Without dead ends: 25174 [2025-01-09 04:56:02,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:56:02,300 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1281 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:02,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 2743 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:56:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25174 states. [2025-01-09 04:56:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25174 to 12684. [2025-01-09 04:56:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12684 states, 12683 states have (on average 1.4781203185366238) internal successors, (18747), 12683 states have internal predecessors, (18747), 0 states have call successors, (0), 0 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:56:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12684 states to 12684 states and 18747 transitions. [2025-01-09 04:56:02,489 INFO L78 Accepts]: Start accepts. Automaton has 12684 states and 18747 transitions. Word has length 142 [2025-01-09 04:56:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 12684 states and 18747 transitions. [2025-01-09 04:56:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12684 states and 18747 transitions. [2025-01-09 04:56:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:02,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:02,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:56:02,491 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:02,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -876630055, now seen corresponding path program 1 times [2025-01-09 04:56:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953889059] [2025-01-09 04:56:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:03,317 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:56:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953889059] [2025-01-09 04:56:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953889059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:03,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:03,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:56:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398739754] [2025-01-09 04:56:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:03,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:56:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:03,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:56:03,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:56:03,319 INFO L87 Difference]: Start difference. First operand 12684 states and 18747 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:04,079 INFO L93 Difference]: Finished difference Result 27700 states and 41037 transitions. [2025-01-09 04:56:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:56:04,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:04,113 INFO L225 Difference]: With dead ends: 27700 [2025-01-09 04:56:04,113 INFO L226 Difference]: Without dead ends: 25078 [2025-01-09 04:56:04,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:56:04,124 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1015 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:04,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3092 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:56:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25078 states. [2025-01-09 04:56:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25078 to 12666. [2025-01-09 04:56:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12665 states have (on average 1.4776154757204896) internal successors, (18714), 12665 states have internal predecessors, (18714), 0 states have call successors, (0), 0 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:56:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 18714 transitions. [2025-01-09 04:56:04,295 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 18714 transitions. Word has length 142 [2025-01-09 04:56:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 12666 states and 18714 transitions. [2025-01-09 04:56:04,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 18714 transitions. [2025-01-09 04:56:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:04,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:04,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:56:04,296 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:04,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 316458939, now seen corresponding path program 1 times [2025-01-09 04:56:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602283465] [2025-01-09 04:56:04,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:04,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:04,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:04,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:04,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:05,004 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:56:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602283465] [2025-01-09 04:56:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602283465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:56:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992993556] [2025-01-09 04:56:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:56:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:56:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:56:05,006 INFO L87 Difference]: Start difference. First operand 12666 states and 18714 transitions. Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:05,715 INFO L93 Difference]: Finished difference Result 52178 states and 77450 transitions. [2025-01-09 04:56:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:56:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:05,769 INFO L225 Difference]: With dead ends: 52178 [2025-01-09 04:56:05,769 INFO L226 Difference]: Without dead ends: 49592 [2025-01-09 04:56:05,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:56:05,787 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1479 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:05,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 3039 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:56:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49592 states. [2025-01-09 04:56:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49592 to 12692. [2025-01-09 04:56:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12692 states, 12691 states have (on average 1.477661334804192) internal successors, (18753), 12691 states have internal predecessors, (18753), 0 states have call successors, (0), 0 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:56:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12692 states to 12692 states and 18753 transitions. [2025-01-09 04:56:06,093 INFO L78 Accepts]: Start accepts. Automaton has 12692 states and 18753 transitions. Word has length 142 [2025-01-09 04:56:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:06,094 INFO L471 AbstractCegarLoop]: Abstraction has 12692 states and 18753 transitions. [2025-01-09 04:56:06,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12692 states and 18753 transitions. [2025-01-09 04:56:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:06,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:06,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:56:06,095 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:06,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:06,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1995731110, now seen corresponding path program 1 times [2025-01-09 04:56:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:06,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685825108] [2025-01-09 04:56:06,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:06,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:06,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:06,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:06,836 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:56:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685825108] [2025-01-09 04:56:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685825108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:56:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941691990] [2025-01-09 04:56:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:06,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:56:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:56:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:56:06,839 INFO L87 Difference]: Start difference. First operand 12692 states and 18753 transitions. Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:07,576 INFO L93 Difference]: Finished difference Result 52558 states and 77907 transitions. [2025-01-09 04:56:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:56:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:07,632 INFO L225 Difference]: With dead ends: 52558 [2025-01-09 04:56:07,632 INFO L226 Difference]: Without dead ends: 49908 [2025-01-09 04:56:07,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:56:07,651 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1734 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:07,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 3171 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:56:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49908 states. [2025-01-09 04:56:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49908 to 12660. [2025-01-09 04:56:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12660 states, 12659 states have (on average 1.4775258709218737) internal successors, (18704), 12659 states have internal predecessors, (18704), 0 states have call successors, (0), 0 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:56:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 18704 transitions. [2025-01-09 04:56:07,926 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 18704 transitions. Word has length 142 [2025-01-09 04:56:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 12660 states and 18704 transitions. [2025-01-09 04:56:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 18704 transitions. [2025-01-09 04:56:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:07,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:07,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:56:07,927 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -694524325, now seen corresponding path program 1 times [2025-01-09 04:56:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783986469] [2025-01-09 04:56:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:07,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,356 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:56:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783986469] [2025-01-09 04:56:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783986469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-01-09 04:56:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137596675] [2025-01-09 04:56:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:56:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:56:09,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:56:09,358 INFO L87 Difference]: Start difference. First operand 12660 states and 18704 transitions. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:12,162 INFO L93 Difference]: Finished difference Result 52690 states and 78059 transitions. [2025-01-09 04:56:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 04:56:12,162 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:12,219 INFO L225 Difference]: With dead ends: 52690 [2025-01-09 04:56:12,219 INFO L226 Difference]: Without dead ends: 50060 [2025-01-09 04:56:12,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=485, Invalid=2167, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 04:56:12,238 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 2402 mSDsluCounter, 8056 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 8699 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:12,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 8699 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:56:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50060 states. [2025-01-09 04:56:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50060 to 12680. [2025-01-09 04:56:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12680 states, 12679 states have (on average 1.4768514867103084) internal successors, (18725), 12679 states have internal predecessors, (18725), 0 states have call successors, (0), 0 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:56:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12680 states to 12680 states and 18725 transitions. [2025-01-09 04:56:12,519 INFO L78 Accepts]: Start accepts. Automaton has 12680 states and 18725 transitions. Word has length 142 [2025-01-09 04:56:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:12,519 INFO L471 AbstractCegarLoop]: Abstraction has 12680 states and 18725 transitions. [2025-01-09 04:56:12,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 12680 states and 18725 transitions. [2025-01-09 04:56:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:12,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:12,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:56:12,520 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1912732381, now seen corresponding path program 1 times [2025-01-09 04:56:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481082813] [2025-01-09 04:56:12,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:12,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:12,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:12,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:13,237 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:56:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481082813] [2025-01-09 04:56:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481082813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:13,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:56:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858446681] [2025-01-09 04:56:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:13,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:56:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:13,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:56:13,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:56:13,240 INFO L87 Difference]: Start difference. First operand 12680 states and 18725 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:13,847 INFO L93 Difference]: Finished difference Result 16597 states and 24535 transitions. [2025-01-09 04:56:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:56:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:13,859 INFO L225 Difference]: With dead ends: 16597 [2025-01-09 04:56:13,860 INFO L226 Difference]: Without dead ends: 13885 [2025-01-09 04:56:13,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:56:13,862 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1508 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:13,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2352 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:56:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13885 states. [2025-01-09 04:56:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13885 to 12585. [2025-01-09 04:56:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12585 states, 12584 states have (on average 1.478305785123967) internal successors, (18603), 12584 states have internal predecessors, (18603), 0 states have call successors, (0), 0 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:56:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12585 states to 12585 states and 18603 transitions. [2025-01-09 04:56:13,957 INFO L78 Accepts]: Start accepts. Automaton has 12585 states and 18603 transitions. Word has length 142 [2025-01-09 04:56:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:13,957 INFO L471 AbstractCegarLoop]: Abstraction has 12585 states and 18603 transitions. [2025-01-09 04:56:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12585 states and 18603 transitions. [2025-01-09 04:56:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:56:13,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:56:13,959 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:13,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -934594466, now seen corresponding path program 1 times [2025-01-09 04:56:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997759372] [2025-01-09 04:56:13,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:13,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:56:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:56:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:14,674 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:56:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997759372] [2025-01-09 04:56:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997759372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:56:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166086505] [2025-01-09 04:56:14,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:56:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:14,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:56:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:56:14,677 INFO L87 Difference]: Start difference. First operand 12585 states and 18603 transitions. Second operand has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:15,101 INFO L93 Difference]: Finished difference Result 27455 states and 40708 transitions. [2025-01-09 04:56:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:56:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:56:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:15,128 INFO L225 Difference]: With dead ends: 27455 [2025-01-09 04:56:15,128 INFO L226 Difference]: Without dead ends: 24808 [2025-01-09 04:56:15,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:56:15,139 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 876 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:15,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 2242 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2025-01-09 04:56:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 12530. [2025-01-09 04:56:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12530 states, 12529 states have (on average 1.4792880517200095) internal successors, (18534), 12529 states have internal predecessors, (18534), 0 states have call successors, (0), 0 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:56:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12530 states to 12530 states and 18534 transitions. [2025-01-09 04:56:15,316 INFO L78 Accepts]: Start accepts. Automaton has 12530 states and 18534 transitions. Word has length 142 [2025-01-09 04:56:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:15,316 INFO L471 AbstractCegarLoop]: Abstraction has 12530 states and 18534 transitions. [2025-01-09 04:56:15,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:56:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12530 states and 18534 transitions. [2025-01-09 04:56:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:56:15,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:15,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:56:15,317 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash 99414207, now seen corresponding path program 1 times [2025-01-09 04:56:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919212672] [2025-01-09 04:56:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:15,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:56:15,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:56:15,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:15,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:20,354 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:56:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919212672] [2025-01-09 04:56:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919212672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2025-01-09 04:56:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520059785] [2025-01-09 04:56:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 04:56:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:20,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 04:56:20,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2387, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 04:56:20,358 INFO L87 Difference]: Start difference. First operand 12530 states and 18534 transitions. Second operand has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:30,275 INFO L93 Difference]: Finished difference Result 27459 states and 40710 transitions. [2025-01-09 04:56:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 04:56:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-09 04:56:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:30,301 INFO L225 Difference]: With dead ends: 27459 [2025-01-09 04:56:30,302 INFO L226 Difference]: Without dead ends: 24873 [2025-01-09 04:56:30,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1276, Invalid=8036, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 04:56:30,313 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1287 mSDsluCounter, 9233 mSDsCounter, 0 mSdLazyCounter, 6794 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 9545 SdHoareTripleChecker+Invalid, 6820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:30,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 9545 Invalid, 6820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6794 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 04:56:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24873 states. [2025-01-09 04:56:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24873 to 12556. [2025-01-09 04:56:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12556 states, 12555 states have (on average 1.4787733970529668) internal successors, (18566), 12555 states have internal predecessors, (18566), 0 states have call successors, (0), 0 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:56:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12556 states to 12556 states and 18566 transitions. [2025-01-09 04:56:30,549 INFO L78 Accepts]: Start accepts. Automaton has 12556 states and 18566 transitions. Word has length 143 [2025-01-09 04:56:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 12556 states and 18566 transitions. [2025-01-09 04:56:30,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12556 states and 18566 transitions. [2025-01-09 04:56:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:56:30,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:30,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:56:30,550 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:30,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1647826627, now seen corresponding path program 1 times [2025-01-09 04:56:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476147820] [2025-01-09 04:56:30,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:30,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:56:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:56:30,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:30,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:30,880 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:56:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476147820] [2025-01-09 04:56:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476147820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449347373] [2025-01-09 04:56:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:30,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:30,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:30,882 INFO L87 Difference]: Start difference. First operand 12556 states and 18566 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:30,932 INFO L93 Difference]: Finished difference Result 12630 states and 18675 transitions. [2025-01-09 04:56:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-09 04:56:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:30,949 INFO L225 Difference]: With dead ends: 12630 [2025-01-09 04:56:30,949 INFO L226 Difference]: Without dead ends: 12628 [2025-01-09 04:56:30,955 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:56:30,956 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1113 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:56:30,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12628 states. [2025-01-09 04:56:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12628 to 12628. [2025-01-09 04:56:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12628 states, 12627 states have (on average 1.4728755840658905) internal successors, (18598), 12627 states have internal predecessors, (18598), 0 states have call successors, (0), 0 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:56:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12628 states to 12628 states and 18598 transitions. [2025-01-09 04:56:31,081 INFO L78 Accepts]: Start accepts. Automaton has 12628 states and 18598 transitions. Word has length 143 [2025-01-09 04:56:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 12628 states and 18598 transitions. [2025-01-09 04:56:31,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12628 states and 18598 transitions. [2025-01-09 04:56:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:56:31,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:31,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:56:31,083 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:31,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1820135423, now seen corresponding path program 1 times [2025-01-09 04:56:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674403077] [2025-01-09 04:56:31,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:31,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:56:31,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:56:31,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:31,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:31,362 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:56:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674403077] [2025-01-09 04:56:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674403077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974319259] [2025-01-09 04:56:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:31,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:31,364 INFO L87 Difference]: Start difference. First operand 12628 states and 18598 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:31,460 INFO L93 Difference]: Finished difference Result 30388 states and 44908 transitions. [2025-01-09 04:56:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-09 04:56:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:31,485 INFO L225 Difference]: With dead ends: 30388 [2025-01-09 04:56:31,486 INFO L226 Difference]: Without dead ends: 18038 [2025-01-09 04:56:31,500 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:56:31,501 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 134 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 679 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:56:31,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 679 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18038 states. [2025-01-09 04:56:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18038 to 17968. [2025-01-09 04:56:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17968 states, 17967 states have (on average 1.4685812879167361) internal successors, (26386), 17967 states have internal predecessors, (26386), 0 states have call successors, (0), 0 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:56:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17968 states to 17968 states and 26386 transitions. [2025-01-09 04:56:31,733 INFO L78 Accepts]: Start accepts. Automaton has 17968 states and 26386 transitions. Word has length 143 [2025-01-09 04:56:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:31,733 INFO L471 AbstractCegarLoop]: Abstraction has 17968 states and 26386 transitions. [2025-01-09 04:56:31,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:56:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17968 states and 26386 transitions. [2025-01-09 04:56:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:56:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:31,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:56:31,734 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 668189268, now seen corresponding path program 1 times [2025-01-09 04:56:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149420846] [2025-01-09 04:56:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:31,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:56:31,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:56:31,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:31,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,815 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:56:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149420846] [2025-01-09 04:56:34,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149420846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2025-01-09 04:56:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120515197] [2025-01-09 04:56:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 04:56:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 04:56:34,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1182, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:56:34,817 INFO L87 Difference]: Start difference. First operand 17968 states and 26386 transitions. Second operand has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)