./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.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/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.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 8cf115d4302a759115807aea65f676f71adc0b6ce2bb4bf80b483d683b67abc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:59:22,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:59:22,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:59:22,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:59:22,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:59:22,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:59:22,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:59:22,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:59:22,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:59:22,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:59:22,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:59:22,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:59:22,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:59:22,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:59:22,439 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:59:22,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:59:22,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:59:22,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:59:22,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:59:22,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:22,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:59:22,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:22,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:59:22,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:59:22,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:59:22,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:59:22,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:59:22,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:59:22,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:59:22,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:59:22,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:59:22,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:59:22,443 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 -> 8cf115d4302a759115807aea65f676f71adc0b6ce2bb4bf80b483d683b67abc2 [2025-01-09 05:59:22,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:59:22,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:59:22,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:59:22,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:59:22,667 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:59:22,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c [2025-01-09 05:59:23,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5c43085/ea73191aa8604f7fb6337d5c3b703b7f/FLAG70393d741 [2025-01-09 05:59:24,265 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:59:24,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c [2025-01-09 05:59:24,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5c43085/ea73191aa8604f7fb6337d5c3b703b7f/FLAG70393d741 [2025-01-09 05:59:24,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5c43085/ea73191aa8604f7fb6337d5c3b703b7f [2025-01-09 05:59:24,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:59:24,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:59:24,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:59:24,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:59:24,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:59:24,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:59:24" (1/1) ... [2025-01-09 05:59:24,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:24, skipping insertion in model container [2025-01-09 05:59:24,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:59:24" (1/1) ... [2025-01-09 05:59:24,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:59:24,747 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/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c[26897,26910] [2025-01-09 05:59:24,804 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/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c[34645,34658] [2025-01-09 05:59:25,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:59:25,197 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:59:25,242 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/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c[26897,26910] [2025-01-09 05:59:25,252 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/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c[34645,34658] [2025-01-09 05:59:25,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:59:25,528 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:59:25,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25 WrapperNode [2025-01-09 05:59:25,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:59:25,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:59:25,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:59:25,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:59:25,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:25,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:25,859 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5288 [2025-01-09 05:59:25,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:59:25,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:59:25,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:59:25,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:59:25,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:25,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:25,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,061 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 05:59:26,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:59:26,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:59:26,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:59:26,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:59:26,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (1/1) ... [2025-01-09 05:59:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:59:26,290 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 05:59:26,295 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 05:59:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:59:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:59:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:59:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:59:26,426 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:59:26,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:59:30,202 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-01-09 05:59:30,203 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:59:30,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:59:30,230 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:59:30,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:59:30 BoogieIcfgContainer [2025-01-09 05:59:30,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:59:30,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:59:30,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:59:30,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:59:30,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:59:24" (1/3) ... [2025-01-09 05:59:30,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d36616a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:59:30, skipping insertion in model container [2025-01-09 05:59:30,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:25" (2/3) ... [2025-01-09 05:59:30,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d36616a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:59:30, skipping insertion in model container [2025-01-09 05:59:30,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:59:30" (3/3) ... [2025-01-09 05:59:30,238 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c [2025-01-09 05:59:30,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:59:30,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label09.c that has 1 procedures, 946 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:59:30,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:59:30,324 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;@16989eff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:59:30,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:59:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 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 05:59:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 05:59:30,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:30,339 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] [2025-01-09 05:59:30,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:30,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 447802254, now seen corresponding path program 1 times [2025-01-09 05:59:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734513808] [2025-01-09 05:59:30,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:30,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 05:59:30,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 05:59:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:30,616 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 05:59:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734513808] [2025-01-09 05:59:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734513808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:30,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:59:30,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547719167] [2025-01-09 05:59:30,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:30,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:59:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:30,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:59:30,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:59:30,643 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 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 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 05:59:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:30,698 INFO L93 Difference]: Finished difference Result 1825 states and 3458 transitions. [2025-01-09 05:59:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:59:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 05:59:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:30,712 INFO L225 Difference]: With dead ends: 1825 [2025-01-09 05:59:30,712 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 05:59:30,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:59:30,718 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:30,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 05:59:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 05:59:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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 05:59:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2025-01-09 05:59:30,791 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2025-01-09 05:59:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2025-01-09 05:59:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 05:59:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2025-01-09 05:59:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 05:59:30,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:30,793 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] [2025-01-09 05:59:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:59:30,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 313788748, now seen corresponding path program 1 times [2025-01-09 05:59:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925609488] [2025-01-09 05:59:30,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 05:59:30,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 05:59:30,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:30,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:31,060 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 05:59:31,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925609488] [2025-01-09 05:59:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925609488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:59:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545306456] [2025-01-09 05:59:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:59:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:31,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:59:31,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:31,062 INFO L87 Difference]: Start difference. First operand 881 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 05:59:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:31,180 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2025-01-09 05:59:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:59:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 05:59:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:31,185 INFO L225 Difference]: With dead ends: 945 [2025-01-09 05:59:31,185 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 05:59:31,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 05:59:31,186 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:31,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 05:59:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 05:59:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 0 states have call successors, (0), 0 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 05:59:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2025-01-09 05:59:31,208 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2025-01-09 05:59:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:31,208 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2025-01-09 05:59:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 05:59:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2025-01-09 05:59:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:59:31,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:31,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:31,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:59:31,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1216126805, now seen corresponding path program 1 times [2025-01-09 05:59:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:31,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250971096] [2025-01-09 05:59:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:31,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:59:31,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:59:31,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:31,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:31,430 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 05:59:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250971096] [2025-01-09 05:59:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250971096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918519178] [2025-01-09 05:59:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:59:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:31,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:59:31,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:59:31,431 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:36,288 INFO L93 Difference]: Finished difference Result 3136 states and 5912 transitions. [2025-01-09 05:59:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:59:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:59:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:36,297 INFO L225 Difference]: With dead ends: 3136 [2025-01-09 05:59:36,297 INFO L226 Difference]: Without dead ends: 2383 [2025-01-09 05:59:36,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:36,298 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2513 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:36,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 875 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 05:59:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-01-09 05:59:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-01-09 05:59:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2381 states have (on average 1.50314993700126) internal successors, (3579), 2382 states have internal predecessors, (3579), 0 states have call successors, (0), 0 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 05:59:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3579 transitions. [2025-01-09 05:59:36,337 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3579 transitions. Word has length 67 [2025-01-09 05:59:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:36,338 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3579 transitions. [2025-01-09 05:59:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3579 transitions. [2025-01-09 05:59:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:59:36,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:36,339 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] [2025-01-09 05:59:36,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:59:36,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash 763987068, now seen corresponding path program 1 times [2025-01-09 05:59:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365386385] [2025-01-09 05:59:36,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:59:36,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:59:36,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:36,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:36,631 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 05:59:36,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:36,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365386385] [2025-01-09 05:59:36,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365386385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:36,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:36,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:36,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123546760] [2025-01-09 05:59:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:36,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:36,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:36,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:36,633 INFO L87 Difference]: Start difference. First operand 2383 states and 3579 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 05:59:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:37,007 INFO L93 Difference]: Finished difference Result 3343 states and 5131 transitions. [2025-01-09 05:59:37,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 05:59:37,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-01-09 05:59:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:37,018 INFO L225 Difference]: With dead ends: 3343 [2025-01-09 05:59:37,018 INFO L226 Difference]: Without dead ends: 3283 [2025-01-09 05:59:37,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:59:37,020 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13456 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13456 SdHoareTripleChecker+Valid, 5839 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:37,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13456 Valid, 5839 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:59:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2025-01-09 05:59:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2441. [2025-01-09 05:59:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5059450594505945) internal successors, (3673), 2440 states have internal predecessors, (3673), 0 states have call successors, (0), 0 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 05:59:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3673 transitions. [2025-01-09 05:59:37,069 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3673 transitions. Word has length 90 [2025-01-09 05:59:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:37,070 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3673 transitions. [2025-01-09 05:59:37,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 05:59:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3673 transitions. [2025-01-09 05:59:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:59:37,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:37,072 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] [2025-01-09 05:59:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:59:37,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1663523956, now seen corresponding path program 1 times [2025-01-09 05:59:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249004364] [2025-01-09 05:59:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:37,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:59:37,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:59:37,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:37,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:37,204 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 05:59:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249004364] [2025-01-09 05:59:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249004364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:37,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318928698] [2025-01-09 05:59:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:37,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:37,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:37,206 INFO L87 Difference]: Start difference. First operand 2441 states and 3673 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 05:59:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:37,233 INFO L93 Difference]: Finished difference Result 2666 states and 4036 transitions. [2025-01-09 05:59:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:59:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:37,243 INFO L225 Difference]: With dead ends: 2666 [2025-01-09 05:59:37,243 INFO L226 Difference]: Without dead ends: 2548 [2025-01-09 05:59:37,244 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 05:59:37,245 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:37,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-01-09 05:59:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-01-09 05:59:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5098270440251573) internal successors, (3841), 2545 states have internal predecessors, (3841), 0 states have call successors, (0), 0 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 05:59:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3841 transitions. [2025-01-09 05:59:37,346 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3841 transitions. Word has length 92 [2025-01-09 05:59:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:37,346 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3841 transitions. [2025-01-09 05:59:37,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 05:59:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3841 transitions. [2025-01-09 05:59:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:59:37,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:37,347 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] [2025-01-09 05:59:37,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:59:37,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1597030444, now seen corresponding path program 1 times [2025-01-09 05:59:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979477255] [2025-01-09 05:59:37,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:37,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:59:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:59:37,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:37,745 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 05:59:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979477255] [2025-01-09 05:59:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979477255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:37,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:37,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388462413] [2025-01-09 05:59:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:37,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:37,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:37,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:37,746 INFO L87 Difference]: Start difference. First operand 2546 states and 3841 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 05:59:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:38,103 INFO L93 Difference]: Finished difference Result 2771 states and 4201 transitions. [2025-01-09 05:59:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:59:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:59:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:38,110 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 05:59:38,111 INFO L226 Difference]: Without dead ends: 2548 [2025-01-09 05:59:38,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:59:38,112 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 3096 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:38,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 2263 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-01-09 05:59:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-01-09 05:59:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5090408805031446) internal successors, (3839), 2545 states have internal predecessors, (3839), 0 states have call successors, (0), 0 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 05:59:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3839 transitions. [2025-01-09 05:59:38,158 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3839 transitions. Word has length 92 [2025-01-09 05:59:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3839 transitions. [2025-01-09 05:59:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 05:59:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3839 transitions. [2025-01-09 05:59:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:59:38,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:38,160 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] [2025-01-09 05:59:38,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:59:38,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:38,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1616940962, now seen corresponding path program 1 times [2025-01-09 05:59:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397574867] [2025-01-09 05:59:38,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:38,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:59:38,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:59:38,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:38,363 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 05:59:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397574867] [2025-01-09 05:59:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397574867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:59:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887860670] [2025-01-09 05:59:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:38,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:59:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:59:38,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:38,365 INFO L87 Difference]: Start difference. First operand 2546 states and 3839 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 05:59:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:38,395 INFO L93 Difference]: Finished difference Result 2554 states and 3848 transitions. [2025-01-09 05:59:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:59:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 05:59:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:38,403 INFO L225 Difference]: With dead ends: 2554 [2025-01-09 05:59:38,403 INFO L226 Difference]: Without dead ends: 2552 [2025-01-09 05:59:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 05:59:38,405 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:38,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-01-09 05:59:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2025-01-09 05:59:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.507450980392157) internal successors, (3844), 2551 states have internal predecessors, (3844), 0 states have call successors, (0), 0 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 05:59:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3844 transitions. [2025-01-09 05:59:38,443 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3844 transitions. Word has length 93 [2025-01-09 05:59:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:38,443 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3844 transitions. [2025-01-09 05:59:38,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 05:59:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3844 transitions. [2025-01-09 05:59:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:38,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:38,444 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] [2025-01-09 05:59:38,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:59:38,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:38,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1163994508, now seen corresponding path program 1 times [2025-01-09 05:59:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970827664] [2025-01-09 05:59:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:38,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:38,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:38,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:38,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:38,511 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 05:59:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970827664] [2025-01-09 05:59:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970827664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757403610] [2025-01-09 05:59:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:38,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:38,512 INFO L87 Difference]: Start difference. First operand 2552 states and 3844 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:38,539 INFO L93 Difference]: Finished difference Result 2794 states and 4225 transitions. [2025-01-09 05:59:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:38,547 INFO L225 Difference]: With dead ends: 2794 [2025-01-09 05:59:38,547 INFO L226 Difference]: Without dead ends: 2670 [2025-01-09 05:59:38,548 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 05:59:38,548 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:38,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-01-09 05:59:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2668. [2025-01-09 05:59:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5097524381095273) internal successors, (4025), 2667 states have internal predecessors, (4025), 0 states have call successors, (0), 0 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 05:59:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4025 transitions. [2025-01-09 05:59:38,628 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4025 transitions. Word has length 94 [2025-01-09 05:59:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4025 transitions. [2025-01-09 05:59:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4025 transitions. [2025-01-09 05:59:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:38,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:38,629 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] [2025-01-09 05:59:38,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:59:38,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:38,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1203905420, now seen corresponding path program 1 times [2025-01-09 05:59:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879274441] [2025-01-09 05:59:38,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:38,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:38,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:38,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:38,698 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 05:59:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879274441] [2025-01-09 05:59:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879274441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:38,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049449181] [2025-01-09 05:59:38,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:38,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:38,701 INFO L87 Difference]: Start difference. First operand 2668 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:38,734 INFO L93 Difference]: Finished difference Result 3330 states and 5065 transitions. [2025-01-09 05:59:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:38,743 INFO L225 Difference]: With dead ends: 3330 [2025-01-09 05:59:38,743 INFO L226 Difference]: Without dead ends: 2987 [2025-01-09 05:59:38,745 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 05:59:38,745 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:38,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-01-09 05:59:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2985. [2025-01-09 05:59:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2983 states have (on average 1.5142474019443513) internal successors, (4517), 2984 states have internal predecessors, (4517), 0 states have call successors, (0), 0 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 05:59:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4517 transitions. [2025-01-09 05:59:38,792 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4517 transitions. Word has length 94 [2025-01-09 05:59:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:38,792 INFO L471 AbstractCegarLoop]: Abstraction has 2985 states and 4517 transitions. [2025-01-09 05:59:38,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4517 transitions. [2025-01-09 05:59:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:38,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:38,793 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] [2025-01-09 05:59:38,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:59:38,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1040990860, now seen corresponding path program 1 times [2025-01-09 05:59:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744684098] [2025-01-09 05:59:38,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:38,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:38,860 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 05:59:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:38,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744684098] [2025-01-09 05:59:38,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744684098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:38,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:38,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977008259] [2025-01-09 05:59:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:38,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:38,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:38,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:38,862 INFO L87 Difference]: Start difference. First operand 2985 states and 4517 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:38,892 INFO L93 Difference]: Finished difference Result 4257 states and 6499 transitions. [2025-01-09 05:59:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:38,903 INFO L225 Difference]: With dead ends: 4257 [2025-01-09 05:59:38,903 INFO L226 Difference]: Without dead ends: 3597 [2025-01-09 05:59:38,905 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 05:59:38,905 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:38,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-01-09 05:59:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3595. [2025-01-09 05:59:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 1.5176732535485666) internal successors, (5453), 3594 states have internal predecessors, (5453), 0 states have call successors, (0), 0 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 05:59:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5453 transitions. [2025-01-09 05:59:38,968 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5453 transitions. Word has length 94 [2025-01-09 05:59:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:38,968 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 5453 transitions. [2025-01-09 05:59:38,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5453 transitions. [2025-01-09 05:59:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:38,969 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] [2025-01-09 05:59:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:59:38,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 461127540, now seen corresponding path program 1 times [2025-01-09 05:59:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457729368] [2025-01-09 05:59:38,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:38,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:38,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:38,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:38,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:39,031 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 05:59:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457729368] [2025-01-09 05:59:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457729368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:39,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:39,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25170] [2025-01-09 05:59:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:39,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:39,032 INFO L87 Difference]: Start difference. First operand 3595 states and 5453 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:39,075 INFO L93 Difference]: Finished difference Result 6039 states and 9223 transitions. [2025-01-09 05:59:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:39,084 INFO L225 Difference]: With dead ends: 6039 [2025-01-09 05:59:39,084 INFO L226 Difference]: Without dead ends: 4769 [2025-01-09 05:59:39,087 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 05:59:39,087 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:39,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1781 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-01-09 05:59:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4767. [2025-01-09 05:59:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4765 states have (on average 1.5171038824763903) internal successors, (7229), 4766 states have internal predecessors, (7229), 0 states have call successors, (0), 0 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 05:59:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 7229 transitions. [2025-01-09 05:59:39,184 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 7229 transitions. Word has length 94 [2025-01-09 05:59:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:39,184 INFO L471 AbstractCegarLoop]: Abstraction has 4767 states and 7229 transitions. [2025-01-09 05:59:39,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 7229 transitions. [2025-01-09 05:59:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:39,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:39,185 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] [2025-01-09 05:59:39,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:59:39,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1754341260, now seen corresponding path program 1 times [2025-01-09 05:59:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017504408] [2025-01-09 05:59:39,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:39,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:39,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:39,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:39,247 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 05:59:39,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:39,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017504408] [2025-01-09 05:59:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017504408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:39,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171911721] [2025-01-09 05:59:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:39,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:39,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:39,248 INFO L87 Difference]: Start difference. First operand 4767 states and 7229 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:39,312 INFO L93 Difference]: Finished difference Result 9459 states and 14383 transitions. [2025-01-09 05:59:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:39,327 INFO L225 Difference]: With dead ends: 9459 [2025-01-09 05:59:39,327 INFO L226 Difference]: Without dead ends: 7017 [2025-01-09 05:59:39,332 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 05:59:39,333 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:39,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-01-09 05:59:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7015. [2025-01-09 05:59:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7015 states, 7013 states have (on average 1.5099101668330244) internal successors, (10589), 7014 states have internal predecessors, (10589), 0 states have call successors, (0), 0 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 05:59:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 10589 transitions. [2025-01-09 05:59:39,524 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 10589 transitions. Word has length 94 [2025-01-09 05:59:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:39,525 INFO L471 AbstractCegarLoop]: Abstraction has 7015 states and 10589 transitions. [2025-01-09 05:59:39,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 10589 transitions. [2025-01-09 05:59:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:39,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:39,526 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] [2025-01-09 05:59:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:59:39,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 26591604, now seen corresponding path program 1 times [2025-01-09 05:59:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279458963] [2025-01-09 05:59:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:39,604 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 05:59:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279458963] [2025-01-09 05:59:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279458963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:39,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870005807] [2025-01-09 05:59:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:39,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:39,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:39,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:39,606 INFO L87 Difference]: Start difference. First operand 7015 states and 10589 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:39,770 INFO L93 Difference]: Finished difference Result 16011 states and 24127 transitions. [2025-01-09 05:59:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:39,793 INFO L225 Difference]: With dead ends: 16011 [2025-01-09 05:59:39,793 INFO L226 Difference]: Without dead ends: 11321 [2025-01-09 05:59:39,801 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 05:59:39,802 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:39,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11321 states. [2025-01-09 05:59:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11321 to 11319. [2025-01-09 05:59:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11319 states, 11317 states have (on average 1.4955376866660777) internal successors, (16925), 11318 states have internal predecessors, (16925), 0 states have call successors, (0), 0 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 05:59:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11319 states to 11319 states and 16925 transitions. [2025-01-09 05:59:40,029 INFO L78 Accepts]: Start accepts. Automaton has 11319 states and 16925 transitions. Word has length 94 [2025-01-09 05:59:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:40,030 INFO L471 AbstractCegarLoop]: Abstraction has 11319 states and 16925 transitions. [2025-01-09 05:59:40,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 11319 states and 16925 transitions. [2025-01-09 05:59:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:40,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:40,031 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] [2025-01-09 05:59:40,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:59:40,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:40,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash -777134476, now seen corresponding path program 1 times [2025-01-09 05:59:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148769193] [2025-01-09 05:59:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:40,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:40,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:40,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:40,099 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 05:59:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148769193] [2025-01-09 05:59:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148769193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515314977] [2025-01-09 05:59:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:40,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:40,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:40,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:40,100 INFO L87 Difference]: Start difference. First operand 11319 states and 16925 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:40,344 INFO L93 Difference]: Finished difference Result 28539 states and 42463 transitions. [2025-01-09 05:59:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:40,374 INFO L225 Difference]: With dead ends: 28539 [2025-01-09 05:59:40,374 INFO L226 Difference]: Without dead ends: 19545 [2025-01-09 05:59:40,382 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 05:59:40,383 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:40,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19545 states. [2025-01-09 05:59:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19545 to 19543. [2025-01-09 05:59:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19543 states, 19541 states have (on average 1.475308326083619) internal successors, (28829), 19542 states have internal predecessors, (28829), 0 states have call successors, (0), 0 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 05:59:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 28829 transitions. [2025-01-09 05:59:40,735 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 28829 transitions. Word has length 94 [2025-01-09 05:59:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 19543 states and 28829 transitions. [2025-01-09 05:59:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 28829 transitions. [2025-01-09 05:59:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:40,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:40,737 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] [2025-01-09 05:59:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:59:40,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1148992372, now seen corresponding path program 1 times [2025-01-09 05:59:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607897952] [2025-01-09 05:59:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:40,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:40,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:40,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:40,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:40,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607897952] [2025-01-09 05:59:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607897952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367550259] [2025-01-09 05:59:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:40,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:40,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:40,801 INFO L87 Difference]: Start difference. First operand 19543 states and 28829 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:41,194 INFO L93 Difference]: Finished difference Result 52443 states and 76831 transitions. [2025-01-09 05:59:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:41,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:41,255 INFO L225 Difference]: With dead ends: 52443 [2025-01-09 05:59:41,255 INFO L226 Difference]: Without dead ends: 35225 [2025-01-09 05:59:41,280 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 05:59:41,281 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:41,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2025-01-09 05:59:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35223. [2025-01-09 05:59:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35221 states have (on average 1.4508673802560972) internal successors, (51101), 35222 states have internal predecessors, (51101), 0 states have call successors, (0), 0 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 05:59:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 51101 transitions. [2025-01-09 05:59:42,039 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 51101 transitions. Word has length 94 [2025-01-09 05:59:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:42,039 INFO L471 AbstractCegarLoop]: Abstraction has 35223 states and 51101 transitions. [2025-01-09 05:59:42,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 51101 transitions. [2025-01-09 05:59:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:59:42,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:42,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:42,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:59:42,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -429562990, now seen corresponding path program 1 times [2025-01-09 05:59:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941249631] [2025-01-09 05:59:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:42,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:59:42,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:59:42,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:59:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941249631] [2025-01-09 05:59:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941249631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250369108] [2025-01-09 05:59:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:42,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:42,291 INFO L87 Difference]: Start difference. First operand 35223 states and 51101 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 05:59:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:46,018 INFO L93 Difference]: Finished difference Result 295209 states and 427174 transitions. [2025-01-09 05:59:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:59:46,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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 119 [2025-01-09 05:59:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:46,566 INFO L225 Difference]: With dead ends: 295209 [2025-01-09 05:59:46,566 INFO L226 Difference]: Without dead ends: 272167 [2025-01-09 05:59:46,645 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 05:59:46,646 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11712 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11712 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:46,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11712 Valid, 4973 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272167 states. [2025-01-09 05:59:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272167 to 63255. [2025-01-09 05:59:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63255 states, 63253 states have (on average 1.4432991320569775) internal successors, (91293), 63254 states have internal predecessors, (91293), 0 states have call successors, (0), 0 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 05:59:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 91293 transitions. [2025-01-09 05:59:49,803 INFO L78 Accepts]: Start accepts. Automaton has 63255 states and 91293 transitions. Word has length 119 [2025-01-09 05:59:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 63255 states and 91293 transitions. [2025-01-09 05:59:49,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 05:59:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 63255 states and 91293 transitions. [2025-01-09 05:59:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:59:49,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:49,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:59:49,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -469473902, now seen corresponding path program 1 times [2025-01-09 05:59:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169557565] [2025-01-09 05:59:49,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:49,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:59:49,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:59:49,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:49,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:59:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169557565] [2025-01-09 05:59:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169557565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803306400] [2025-01-09 05:59:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:50,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:50,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:50,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:50,040 INFO L87 Difference]: Start difference. First operand 63255 states and 91293 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:55,623 INFO L93 Difference]: Finished difference Result 328105 states and 474534 transitions. [2025-01-09 05:59:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:59:55,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 05:59:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:56,160 INFO L225 Difference]: With dead ends: 328105 [2025-01-09 05:59:56,160 INFO L226 Difference]: Without dead ends: 295207 [2025-01-09 05:59:56,240 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 05:59:56,241 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11786 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11786 SdHoareTripleChecker+Valid, 5066 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:56,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11786 Valid, 5066 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295207 states. [2025-01-09 06:00:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295207 to 107671. [2025-01-09 06:00:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107671 states, 107669 states have (on average 1.4387521013476487) internal successors, (154909), 107670 states have internal predecessors, (154909), 0 states have call successors, (0), 0 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 06:00:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107671 states to 107671 states and 154909 transitions. [2025-01-09 06:00:00,433 INFO L78 Accepts]: Start accepts. Automaton has 107671 states and 154909 transitions. Word has length 119 [2025-01-09 06:00:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:00:00,434 INFO L471 AbstractCegarLoop]: Abstraction has 107671 states and 154909 transitions. [2025-01-09 06:00:00,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:00:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107671 states and 154909 transitions. [2025-01-09 06:00:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:00:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:00,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:00:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:00:00,444 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:00,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash -306559342, now seen corresponding path program 1 times [2025-01-09 06:00:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39129606] [2025-01-09 06:00:00,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:00,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:00:00,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:00:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:00:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 06:00:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:00:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39129606] [2025-01-09 06:00:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39129606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:00:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:00:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:00:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121487872] [2025-01-09 06:00:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:00:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:00:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:00:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:00:00,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:00:00,868 INFO L87 Difference]: Start difference. First operand 107671 states and 154909 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:00:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:00:07,624 INFO L93 Difference]: Finished difference Result 361001 states and 521766 transitions. [2025-01-09 06:00:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:00:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 06:00:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:00:08,178 INFO L225 Difference]: With dead ends: 361001 [2025-01-09 06:00:08,178 INFO L226 Difference]: Without dead ends: 328103 [2025-01-09 06:00:08,251 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 06:00:08,252 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 11886 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11886 SdHoareTripleChecker+Valid, 4892 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:00:08,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11886 Valid, 4892 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:00:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328103 states.