./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.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.7.ufo.BOUNDED-14.pals+Problem12_label08.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 fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:57:45,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:57:45,696 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:57:45,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:57:45,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:57:45,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:57:45,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:57:45,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:57:45,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:57:45,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:57:45,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:57:45,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:57:45,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:45,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:57:45,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:45,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:57:45,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:57:45,719 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 -> fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 [2025-01-09 05:57:45,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:57:45,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:57:45,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:57:45,934 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:57:45,934 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:57:45,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-01-09 05:57:47,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2adbce558/e1f8de9ba2e0453284cd6e2cc6d9cb01/FLAGaf9005f1c [2025-01-09 05:57:47,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:57:47,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-01-09 05:57:47,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2adbce558/e1f8de9ba2e0453284cd6e2cc6d9cb01/FLAGaf9005f1c [2025-01-09 05:57:47,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2adbce558/e1f8de9ba2e0453284cd6e2cc6d9cb01 [2025-01-09 05:57:47,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:57:47,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:57:47,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:57:47,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:57:47,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:57:47,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:57:47" (1/1) ... [2025-01-09 05:57:47,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16548d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:47, skipping insertion in model container [2025-01-09 05:57:47,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:57:47" (1/1) ... [2025-01-09 05:57:47,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:57:48,001 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.7.ufo.BOUNDED-14.pals+Problem12_label08.c[20426,20439] [2025-01-09 05:57:48,033 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.7.ufo.BOUNDED-14.pals+Problem12_label08.c[23933,23946] [2025-01-09 05:57:48,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:57:48,435 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:57:48,468 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.7.ufo.BOUNDED-14.pals+Problem12_label08.c[20426,20439] [2025-01-09 05:57:48,476 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.7.ufo.BOUNDED-14.pals+Problem12_label08.c[23933,23946] [2025-01-09 05:57:48,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:57:48,758 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:57:48,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48 WrapperNode [2025-01-09 05:57:48,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:57:48,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:57:48,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:57:48,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:57:48,767 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:57:48" (1/1) ... [2025-01-09 05:57:48,819 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:57:48" (1/1) ... [2025-01-09 05:57:49,178 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2025-01-09 05:57:49,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:57:49,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:57:49,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:57:49,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:57:49,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,397 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:57:49,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:57:49,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:57:49,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:57:49,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:57:49,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (1/1) ... [2025-01-09 05:57:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:57:49,695 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:57:49,707 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:57:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:57:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:57:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:57:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:57:49,925 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:57:49,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:57:53,623 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-09 05:57:53,623 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:57:53,648 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:57:53,653 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:57:53,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:57:53 BoogieIcfgContainer [2025-01-09 05:57:53,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:57:53,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:57:53,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:57:53,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:57:53,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:57:47" (1/3) ... [2025-01-09 05:57:53,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6394cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:57:53, skipping insertion in model container [2025-01-09 05:57:53,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:48" (2/3) ... [2025-01-09 05:57:53,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6394cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:57:53, skipping insertion in model container [2025-01-09 05:57:53,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:57:53" (3/3) ... [2025-01-09 05:57:53,669 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-01-09 05:57:53,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:57:53,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c that has 1 procedures, 929 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:57:53,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:57:53,828 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;@46740f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:57:53,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:57:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have 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:57:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:57:53,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:53,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:53,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:53,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash 460735637, now seen corresponding path program 1 times [2025-01-09 05:57:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390803617] [2025-01-09 05:57:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:53,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:57:54,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:57:54,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:54,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:54,154 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:57:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390803617] [2025-01-09 05:57:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390803617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:54,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:57:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147411816] [2025-01-09 05:57:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:57:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:54,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:57:54,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:57:54,180 INFO L87 Difference]: Start difference. First operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:57:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:54,245 INFO L93 Difference]: Finished difference Result 1802 states and 3416 transitions. [2025-01-09 05:57:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:57:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-09 05:57:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:54,267 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 05:57:54,267 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 05:57:54,275 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:57:54,277 INFO L435 NwaCegarLoop]: 1698 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, 1698 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:57:54,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 05:57:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-01-09 05:57:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8932714617169373) internal successors, (1632), 863 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have 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:57:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2025-01-09 05:57:54,350 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2025-01-09 05:57:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:54,351 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2025-01-09 05:57:54,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:57:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2025-01-09 05:57:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:57:54,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:54,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:54,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:57:54,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:54,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 679590355, now seen corresponding path program 1 times [2025-01-09 05:57:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21466164] [2025-01-09 05:57:54,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:57:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:57:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:54,563 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:57:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21466164] [2025-01-09 05:57:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21466164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:54,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:54,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:57:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366711921] [2025-01-09 05:57:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:54,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:57:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:54,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:57:54,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:57:54,565 INFO L87 Difference]: Start difference. First operand 864 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:57:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:54,661 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2025-01-09 05:57:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:57:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-09 05:57:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:54,665 INFO L225 Difference]: With dead ends: 922 [2025-01-09 05:57:54,665 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 05:57:54,666 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:57:54,666 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:54,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 05:57:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-01-09 05:57:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8352668213457077) internal successors, (1582), 863 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have 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:57:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2025-01-09 05:57:54,687 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2025-01-09 05:57:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:54,687 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2025-01-09 05:57:54,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:57:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2025-01-09 05:57:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 05:57:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:54,688 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:57:54,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:57:54,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:54,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash 486178056, now seen corresponding path program 1 times [2025-01-09 05:57:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807740862] [2025-01-09 05:57:54,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:54,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 05:57:54,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 05:57:54,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:54,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:54,740 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:57:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807740862] [2025-01-09 05:57:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807740862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:57:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393650014] [2025-01-09 05:57:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:54,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:54,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:54,741 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 10.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:57:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:57,955 INFO L93 Difference]: Finished difference Result 2368 states and 4455 transitions. [2025-01-09 05:57:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.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:57:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:57,961 INFO L225 Difference]: With dead ends: 2368 [2025-01-09 05:57:57,962 INFO L226 Difference]: Without dead ends: 1615 [2025-01-09 05:57:57,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,963 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 914 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:57,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 618 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 05:57:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-01-09 05:57:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-01-09 05:57:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.5877247365158091) internal successors, (2561), 1614 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have 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:57:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2561 transitions. [2025-01-09 05:57:58,006 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2561 transitions. Word has length 30 [2025-01-09 05:57:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:58,006 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2561 transitions. [2025-01-09 05:57:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.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:57:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2561 transitions. [2025-01-09 05:57:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:57:58,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:58,012 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] [2025-01-09 05:57:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:57:58,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -620307086, now seen corresponding path program 1 times [2025-01-09 05:57:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213408981] [2025-01-09 05:57:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:58,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:57:58,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:57:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213408981] [2025-01-09 05:57:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213408981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:58,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:58,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203923397] [2025-01-09 05:57:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:58,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:58,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:58,319 INFO L87 Difference]: Start difference. First operand 1615 states and 2561 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:57:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:58,738 INFO L93 Difference]: Finished difference Result 2371 states and 3779 transitions. [2025-01-09 05:57:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:57:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-01-09 05:57:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:58,745 INFO L225 Difference]: With dead ends: 2371 [2025-01-09 05:57:58,746 INFO L226 Difference]: Without dead ends: 2317 [2025-01-09 05:57:58,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:57:58,747 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11506 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11506 SdHoareTripleChecker+Valid, 4711 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:58,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11506 Valid, 4711 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:57:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-01-09 05:57:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1667. [2025-01-09 05:57:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.5885885885885886) internal successors, (2645), 1666 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have 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:57:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2645 transitions. [2025-01-09 05:57:58,841 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2645 transitions. Word has length 77 [2025-01-09 05:57:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:58,842 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2645 transitions. [2025-01-09 05:57:58,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:57:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2645 transitions. [2025-01-09 05:57:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:57:58,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:58,846 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] [2025-01-09 05:57:58,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:57:58,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -530347134, now seen corresponding path program 1 times [2025-01-09 05:57:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220307152] [2025-01-09 05:57:58,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:58,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:57:58,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:57:58,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:58,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:59,003 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:57:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220307152] [2025-01-09 05:57:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220307152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403954000] [2025-01-09 05:57:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:59,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:59,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:59,005 INFO L87 Difference]: Start difference. First operand 1667 states and 2645 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:59,056 INFO L93 Difference]: Finished difference Result 1868 states and 2968 transitions. [2025-01-09 05:57:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 05:57:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:59,069 INFO L225 Difference]: With dead ends: 1868 [2025-01-09 05:57:59,070 INFO L226 Difference]: Without dead ends: 1762 [2025-01-09 05:57:59,070 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:57:59,071 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 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:57:59,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-01-09 05:57:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-01-09 05:57:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.5887372013651877) internal successors, (2793), 1759 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have 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:57:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2793 transitions. [2025-01-09 05:57:59,139 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2793 transitions. Word has length 79 [2025-01-09 05:57:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2793 transitions. [2025-01-09 05:57:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2793 transitions. [2025-01-09 05:57:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:57:59,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:59,140 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] [2025-01-09 05:57:59,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:57:59,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:59,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash -463853622, now seen corresponding path program 1 times [2025-01-09 05:57:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955833011] [2025-01-09 05:57:59,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:59,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:57:59,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:57:59,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:59,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:59,504 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:57:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955833011] [2025-01-09 05:57:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955833011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977620256] [2025-01-09 05:57:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:59,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:59,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:59,506 INFO L87 Difference]: Start difference. First operand 1760 states and 2793 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:59,777 INFO L93 Difference]: Finished difference Result 1961 states and 3113 transitions. [2025-01-09 05:57:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 05:57:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:59,783 INFO L225 Difference]: With dead ends: 1961 [2025-01-09 05:57:59,784 INFO L226 Difference]: Without dead ends: 1762 [2025-01-09 05:57:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:57:59,786 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 3058 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:59,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 2083 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-01-09 05:57:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-01-09 05:57:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.587599544937429) internal successors, (2791), 1759 states have internal predecessors, (2791), 0 states have call successors, (0), 0 states have 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:57:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2791 transitions. [2025-01-09 05:57:59,816 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2791 transitions. Word has length 79 [2025-01-09 05:57:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:59,816 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2791 transitions. [2025-01-09 05:57:59,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2791 transitions. [2025-01-09 05:57:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:57:59,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:59,818 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] [2025-01-09 05:57:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:57:59,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1909283312, now seen corresponding path program 1 times [2025-01-09 05:57:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757151580] [2025-01-09 05:57:59,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:59,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:57:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:57:59,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:59,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,062 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:58:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757151580] [2025-01-09 05:58:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757151580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:58:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532659718] [2025-01-09 05:58:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:58:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:58:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:58:00,063 INFO L87 Difference]: Start difference. First operand 1760 states and 2791 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:58:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,120 INFO L93 Difference]: Finished difference Result 1768 states and 2800 transitions. [2025-01-09 05:58:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:58:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 05:58:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,125 INFO L225 Difference]: With dead ends: 1768 [2025-01-09 05:58:00,125 INFO L226 Difference]: Without dead ends: 1766 [2025-01-09 05:58:00,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:58:00,126 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:00,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-01-09 05:58:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-01-09 05:58:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.5850340136054422) internal successors, (2796), 1765 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have 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:58:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2796 transitions. [2025-01-09 05:58:00,206 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2796 transitions. Word has length 80 [2025-01-09 05:58:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2796 transitions. [2025-01-09 05:58:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:58:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2796 transitions. [2025-01-09 05:58:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:00,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:00,208 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] [2025-01-09 05:58:00,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:58:00,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:00,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash -789777814, now seen corresponding path program 1 times [2025-01-09 05:58:00,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:00,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030110821] [2025-01-09 05:58:00,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:00,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:00,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:00,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:00,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,293 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:58:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030110821] [2025-01-09 05:58:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030110821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304587449] [2025-01-09 05:58:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:00,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:00,295 INFO L87 Difference]: Start difference. First operand 1766 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,320 INFO L93 Difference]: Finished difference Result 1984 states and 3137 transitions. [2025-01-09 05:58:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,326 INFO L225 Difference]: With dead ends: 1984 [2025-01-09 05:58:00,327 INFO L226 Difference]: Without dead ends: 1872 [2025-01-09 05:58:00,327 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:58:00,328 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 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:58:00,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-01-09 05:58:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1870. [2025-01-09 05:58:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1868 states have (on average 1.5829764453961457) internal successors, (2957), 1869 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have 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:58:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2957 transitions. [2025-01-09 05:58:00,360 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2957 transitions. Word has length 81 [2025-01-09 05:58:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:00,360 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2957 transitions. [2025-01-09 05:58:00,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2957 transitions. [2025-01-09 05:58:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:00,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:00,361 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] [2025-01-09 05:58:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:58:00,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1315206250, now seen corresponding path program 1 times [2025-01-09 05:58:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109681112] [2025-01-09 05:58:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:00,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:00,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:00,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,410 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:58:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109681112] [2025-01-09 05:58:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109681112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903934885] [2025-01-09 05:58:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:00,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:00,412 INFO L87 Difference]: Start difference. First operand 1870 states and 2957 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,438 INFO L93 Difference]: Finished difference Result 2460 states and 3877 transitions. [2025-01-09 05:58:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,445 INFO L225 Difference]: With dead ends: 2460 [2025-01-09 05:58:00,445 INFO L226 Difference]: Without dead ends: 2153 [2025-01-09 05:58:00,446 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:58:00,446 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1742 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:58:00,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-09 05:58:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2151. [2025-01-09 05:58:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2149 states have (on average 1.577012563983248) internal successors, (3389), 2150 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have 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:58:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3389 transitions. [2025-01-09 05:58:00,485 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3389 transitions. Word has length 81 [2025-01-09 05:58:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:00,486 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3389 transitions. [2025-01-09 05:58:00,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3389 transitions. [2025-01-09 05:58:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:00,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:00,487 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] [2025-01-09 05:58:00,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:58:00,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1579062634, now seen corresponding path program 1 times [2025-01-09 05:58:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982123180] [2025-01-09 05:58:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:00,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:00,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:00,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,538 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:58:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982123180] [2025-01-09 05:58:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982123180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135488185] [2025-01-09 05:58:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:00,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:00,540 INFO L87 Difference]: Start difference. First operand 2151 states and 3389 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,568 INFO L93 Difference]: Finished difference Result 3279 states and 5131 transitions. [2025-01-09 05:58:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,577 INFO L225 Difference]: With dead ends: 3279 [2025-01-09 05:58:00,577 INFO L226 Difference]: Without dead ends: 2691 [2025-01-09 05:58:00,579 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:58:00,579 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1744 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:58:00,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-01-09 05:58:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2689. [2025-01-09 05:58:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2687 states have (on average 1.5649423148492743) internal successors, (4205), 2688 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have 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:58:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4205 transitions. [2025-01-09 05:58:00,629 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4205 transitions. Word has length 81 [2025-01-09 05:58:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4205 transitions. [2025-01-09 05:58:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4205 transitions. [2025-01-09 05:58:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:00,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:00,631 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] [2025-01-09 05:58:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:58:00,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1477642646, now seen corresponding path program 1 times [2025-01-09 05:58:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:00,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060094110] [2025-01-09 05:58:00,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:00,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:00,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:00,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,682 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:58:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060094110] [2025-01-09 05:58:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060094110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597802592] [2025-01-09 05:58:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:00,684 INFO L87 Difference]: Start difference. First operand 2689 states and 4205 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,723 INFO L93 Difference]: Finished difference Result 4845 states and 7495 transitions. [2025-01-09 05:58:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,734 INFO L225 Difference]: With dead ends: 4845 [2025-01-09 05:58:00,734 INFO L226 Difference]: Without dead ends: 3719 [2025-01-09 05:58:00,736 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:58:00,736 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1746 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:58:00,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1746 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-01-09 05:58:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2025-01-09 05:58:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3715 states have (on average 1.5453566621803498) internal successors, (5741), 3716 states have internal predecessors, (5741), 0 states have call successors, (0), 0 states have 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:58:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5741 transitions. [2025-01-09 05:58:00,802 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5741 transitions. Word has length 81 [2025-01-09 05:58:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 5741 transitions. [2025-01-09 05:58:00,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5741 transitions. [2025-01-09 05:58:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:00,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:00,803 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] [2025-01-09 05:58:00,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:58:00,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 601855850, now seen corresponding path program 1 times [2025-01-09 05:58:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115445230] [2025-01-09 05:58:00,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:00,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:00,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:00,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:00,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:00,850 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:58:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:00,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115445230] [2025-01-09 05:58:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115445230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:00,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910695745] [2025-01-09 05:58:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:00,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:00,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:00,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:00,851 INFO L87 Difference]: Start difference. First operand 3717 states and 5741 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:00,910 INFO L93 Difference]: Finished difference Result 7833 states and 11935 transitions. [2025-01-09 05:58:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:00,926 INFO L225 Difference]: With dead ends: 7833 [2025-01-09 05:58:00,926 INFO L226 Difference]: Without dead ends: 5679 [2025-01-09 05:58:00,930 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:58:00,931 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1748 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:58:00,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2025-01-09 05:58:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 5677. [2025-01-09 05:58:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5675 states have (on average 1.5191189427312775) internal successors, (8621), 5676 states have internal predecessors, (8621), 0 states have call successors, (0), 0 states have 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:58:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 8621 transitions. [2025-01-09 05:58:01,126 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 8621 transitions. Word has length 81 [2025-01-09 05:58:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 8621 transitions. [2025-01-09 05:58:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 8621 transitions. [2025-01-09 05:58:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:01,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:01,128 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] [2025-01-09 05:58:01,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:58:01,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:01,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1912178582, now seen corresponding path program 1 times [2025-01-09 05:58:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623959143] [2025-01-09 05:58:01,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:01,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:01,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:01,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:01,185 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:58:01,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:01,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623959143] [2025-01-09 05:58:01,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623959143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:01,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85007144] [2025-01-09 05:58:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:01,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:01,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:01,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:01,187 INFO L87 Difference]: Start difference. First operand 5677 states and 8621 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:01,320 INFO L93 Difference]: Finished difference Result 13521 states and 20239 transitions. [2025-01-09 05:58:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:01,342 INFO L225 Difference]: With dead ends: 13521 [2025-01-09 05:58:01,342 INFO L226 Difference]: Without dead ends: 9407 [2025-01-09 05:58:01,350 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:58:01,350 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1750 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:58:01,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9407 states. [2025-01-09 05:58:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9407 to 9405. [2025-01-09 05:58:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9405 states, 9403 states have (on average 1.48856747846432) internal successors, (13997), 9404 states have internal predecessors, (13997), 0 states have call successors, (0), 0 states have 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:58:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9405 states to 9405 states and 13997 transitions. [2025-01-09 05:58:01,574 INFO L78 Accepts]: Start accepts. Automaton has 9405 states and 13997 transitions. Word has length 81 [2025-01-09 05:58:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:01,575 INFO L471 AbstractCegarLoop]: Abstraction has 9405 states and 13997 transitions. [2025-01-09 05:58:01,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9405 states and 13997 transitions. [2025-01-09 05:58:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:01,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:01,576 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] [2025-01-09 05:58:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:58:01,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:01,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1152291690, now seen corresponding path program 1 times [2025-01-09 05:58:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:01,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062150787] [2025-01-09 05:58:01,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:01,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:01,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:01,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:01,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:01,625 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:58:01,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062150787] [2025-01-09 05:58:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062150787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:01,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176574153] [2025-01-09 05:58:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:01,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:01,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:01,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:01,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:01,627 INFO L87 Difference]: Start difference. First operand 9405 states and 13997 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:01,799 INFO L93 Difference]: Finished difference Result 24321 states and 35695 transitions. [2025-01-09 05:58:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:01,833 INFO L225 Difference]: With dead ends: 24321 [2025-01-09 05:58:01,833 INFO L226 Difference]: Without dead ends: 16479 [2025-01-09 05:58:01,846 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:58:01,847 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 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:58:01,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16479 states. [2025-01-09 05:58:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16479 to 16477. [2025-01-09 05:58:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16477 states, 16475 states have (on average 1.4555993930197269) internal successors, (23981), 16476 states have internal predecessors, (23981), 0 states have call successors, (0), 0 states have 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:58:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16477 states to 16477 states and 23981 transitions. [2025-01-09 05:58:02,289 INFO L78 Accepts]: Start accepts. Automaton has 16477 states and 23981 transitions. Word has length 81 [2025-01-09 05:58:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 16477 states and 23981 transitions. [2025-01-09 05:58:02,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16477 states and 23981 transitions. [2025-01-09 05:58:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:02,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:02,293 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:58:02,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1255535689, now seen corresponding path program 1 times [2025-01-09 05:58:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:02,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996247203] [2025-01-09 05:58:02,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:02,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:02,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:02,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:02,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:58:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996247203] [2025-01-09 05:58:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996247203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:02,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:02,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303400672] [2025-01-09 05:58:02,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:02,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:02,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:02,489 INFO L87 Difference]: Start difference. First operand 16477 states and 23981 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:58:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:03,716 INFO L93 Difference]: Finished difference Result 119533 states and 172469 transitions. [2025-01-09 05:58:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2025-01-09 05:58:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:04,001 INFO L225 Difference]: With dead ends: 119533 [2025-01-09 05:58:04,001 INFO L226 Difference]: Without dead ends: 109035 [2025-01-09 05:58:04,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:04,035 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9793 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9793 SdHoareTripleChecker+Valid, 4508 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:04,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9793 Valid, 4508 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109035 states. [2025-01-09 05:58:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109035 to 29213. [2025-01-09 05:58:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29213 states, 29211 states have (on average 1.4431892095443497) internal successors, (42157), 29212 states have internal predecessors, (42157), 0 states have call successors, (0), 0 states have 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:58:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29213 states to 29213 states and 42157 transitions. [2025-01-09 05:58:05,519 INFO L78 Accepts]: Start accepts. Automaton has 29213 states and 42157 transitions. Word has length 104 [2025-01-09 05:58:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:05,519 INFO L471 AbstractCegarLoop]: Abstraction has 29213 states and 42157 transitions. [2025-01-09 05:58:05,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:58:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 29213 states and 42157 transitions. [2025-01-09 05:58:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:05,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:05,526 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:58:05,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -934447543, now seen corresponding path program 1 times [2025-01-09 05:58:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119753556] [2025-01-09 05:58:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:05,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:05,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:58:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119753556] [2025-01-09 05:58:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119753556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401443679] [2025-01-09 05:58:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:05,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:05,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:05,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:05,770 INFO L87 Difference]: Start difference. First operand 29213 states and 42157 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:58:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:07,502 INFO L93 Difference]: Finished difference Result 134445 states and 193845 transitions. [2025-01-09 05:58:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2025-01-09 05:58:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:07,683 INFO L225 Difference]: With dead ends: 134445 [2025-01-09 05:58:07,684 INFO L226 Difference]: Without dead ends: 119531 [2025-01-09 05:58:07,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:07,721 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9859 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9859 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:07,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9859 Valid, 4557 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119531 states. [2025-01-09 05:58:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119531 to 49373. [2025-01-09 05:58:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49373 states, 49371 states have (on average 1.4359239229507201) internal successors, (70893), 49372 states have internal predecessors, (70893), 0 states have call successors, (0), 0 states have 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:58:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49373 states to 49373 states and 70893 transitions. [2025-01-09 05:58:09,577 INFO L78 Accepts]: Start accepts. Automaton has 49373 states and 70893 transitions. Word has length 104 [2025-01-09 05:58:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 49373 states and 70893 transitions. [2025-01-09 05:58:09,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:58:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49373 states and 70893 transitions. [2025-01-09 05:58:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:09,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:09,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:58:09,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -670591159, now seen corresponding path program 1 times [2025-01-09 05:58:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126059707] [2025-01-09 05:58:09,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:09,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:09,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:09,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:58:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:09,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126059707] [2025-01-09 05:58:09,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126059707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:09,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:09,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:09,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887346161] [2025-01-09 05:58:09,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:09,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:09,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:09,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:09,791 INFO L87 Difference]: Start difference. First operand 49373 states and 70893 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:11,947 INFO L93 Difference]: Finished difference Result 149357 states and 215157 transitions. [2025-01-09 05:58:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:58:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:12,102 INFO L225 Difference]: With dead ends: 149357 [2025-01-09 05:58:12,102 INFO L226 Difference]: Without dead ends: 134443 [2025-01-09 05:58:12,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:12,143 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9907 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9907 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:12,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9907 Valid, 4422 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134443 states. [2025-01-09 05:58:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134443 to 64285. [2025-01-09 05:58:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64285 states, 64283 states have (on average 1.434360561890391) internal successors, (92205), 64284 states have internal predecessors, (92205), 0 states have call successors, (0), 0 states have 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:58:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64285 states to 64285 states and 92205 transitions. [2025-01-09 05:58:14,543 INFO L78 Accepts]: Start accepts. Automaton has 64285 states and 92205 transitions. Word has length 104 [2025-01-09 05:58:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:14,543 INFO L471 AbstractCegarLoop]: Abstraction has 64285 states and 92205 transitions. [2025-01-09 05:58:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 64285 states and 92205 transitions. [2025-01-09 05:58:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:14,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:14,551 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:14,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:58:14,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash 567670857, now seen corresponding path program 1 times [2025-01-09 05:58:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:14,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930763804] [2025-01-09 05:58:14,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:14,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:14,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:14,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:14,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:58:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930763804] [2025-01-09 05:58:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930763804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334373451] [2025-01-09 05:58:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:14,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:14,751 INFO L87 Difference]: Start difference. First operand 64285 states and 92205 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:17,866 INFO L93 Difference]: Finished difference Result 164269 states and 236469 transitions. [2025-01-09 05:58:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:58:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:18,102 INFO L225 Difference]: With dead ends: 164269 [2025-01-09 05:58:18,102 INFO L226 Difference]: Without dead ends: 149355 [2025-01-09 05:58:18,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:18,146 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9954 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9954 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:18,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9954 Valid, 4389 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149355 states. [2025-01-09 05:58:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149355 to 79197. [2025-01-09 05:58:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79197 states, 79195 states have (on average 1.4333859460824547) internal successors, (113517), 79196 states have internal predecessors, (113517), 0 states have call successors, (0), 0 states have 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:58:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79197 states to 79197 states and 113517 transitions. [2025-01-09 05:58:21,080 INFO L78 Accepts]: Start accepts. Automaton has 79197 states and 113517 transitions. Word has length 104 [2025-01-09 05:58:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:21,080 INFO L471 AbstractCegarLoop]: Abstraction has 79197 states and 113517 transitions. [2025-01-09 05:58:21,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79197 states and 113517 transitions. [2025-01-09 05:58:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:21,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:21,099 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:21,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:58:21,099 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1647797943, now seen corresponding path program 1 times [2025-01-09 05:58:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524794069] [2025-01-09 05:58:21,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:21,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:21,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:58:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524794069] [2025-01-09 05:58:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524794069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132931120] [2025-01-09 05:58:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:21,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:21,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:21,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:21,303 INFO L87 Difference]: Start difference. First operand 79197 states and 113517 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:58:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:24,530 INFO L93 Difference]: Finished difference Result 179181 states and 257781 transitions. [2025-01-09 05:58:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 104 [2025-01-09 05:58:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:24,750 INFO L225 Difference]: With dead ends: 179181 [2025-01-09 05:58:24,750 INFO L226 Difference]: Without dead ends: 164267 [2025-01-09 05:58:24,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:24,798 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 10010 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10010 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:24,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10010 Valid, 4417 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164267 states. [2025-01-09 05:58:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164267 to 94109. [2025-01-09 05:58:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94109 states, 94107 states have (on average 1.4327202014727916) internal successors, (134829), 94108 states have internal predecessors, (134829), 0 states have call successors, (0), 0 states have 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:58:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94109 states to 94109 states and 134829 transitions. [2025-01-09 05:58:27,512 INFO L78 Accepts]: Start accepts. Automaton has 94109 states and 134829 transitions. Word has length 104 [2025-01-09 05:58:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:27,512 INFO L471 AbstractCegarLoop]: Abstraction has 94109 states and 134829 transitions. [2025-01-09 05:58:27,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:58:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 94109 states and 134829 transitions. [2025-01-09 05:58:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:27,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:27,518 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:58:27,518 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 133134921, now seen corresponding path program 1 times [2025-01-09 05:58:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249965609] [2025-01-09 05:58:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:27,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:27,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:27,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:27,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:58:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249965609] [2025-01-09 05:58:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249965609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292405780] [2025-01-09 05:58:27,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:27,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:27,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:27,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:27,686 INFO L87 Difference]: Start difference. First operand 94109 states and 134829 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)