./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label04.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.1.ufo.BOUNDED-14.pals+Problem12_label04.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 0b1d580d3f8679b815687842b0e80c1df3007c37f6779ca6f39993c20d2be34d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:56:32,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:56:32,446 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:56:32,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:56:32,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:56:32,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:56:32,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:56:32,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:56:32,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:56:32,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:56:32,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:56:32,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:56:32,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:56:32,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:56:32,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:56:32,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:56:32,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:32,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:32,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:56:32,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:56:32,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:56:32,485 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 -> 0b1d580d3f8679b815687842b0e80c1df3007c37f6779ca6f39993c20d2be34d [2025-01-09 05:56:32,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:56:32,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:56:32,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:56:32,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:56:32,905 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:56:32,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label04.c [2025-01-09 05:56:34,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8553ab82a/a80b4798f6f54147a4f451e3ae7ca1fb/FLAGcc173e968 [2025-01-09 05:56:34,793 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:56:34,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label04.c [2025-01-09 05:56:34,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8553ab82a/a80b4798f6f54147a4f451e3ae7ca1fb/FLAGcc173e968 [2025-01-09 05:56:34,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8553ab82a/a80b4798f6f54147a4f451e3ae7ca1fb [2025-01-09 05:56:34,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:56:34,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:56:34,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:56:34,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:56:34,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:56:34,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:56:34" (1/1) ... [2025-01-09 05:56:34,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:34, skipping insertion in model container [2025-01-09 05:56:34,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:56:34" (1/1) ... [2025-01-09 05:56:35,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:56:35,364 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.1.ufo.BOUNDED-14.pals+Problem12_label04.c[20463,20476] [2025-01-09 05:56:35,423 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.1.ufo.BOUNDED-14.pals+Problem12_label04.c[27524,27537] [2025-01-09 05:56:35,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:56:35,843 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:56:35,869 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.1.ufo.BOUNDED-14.pals+Problem12_label04.c[20463,20476] [2025-01-09 05:56:35,873 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.1.ufo.BOUNDED-14.pals+Problem12_label04.c[27524,27537] [2025-01-09 05:56:36,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:56:36,128 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:56:36,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36 WrapperNode [2025-01-09 05:56:36,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:56:36,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:56:36,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:56:36,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:56:36,133 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:56:36" (1/1) ... [2025-01-09 05:56:36,173 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:56:36" (1/1) ... [2025-01-09 05:56:36,585 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5216 [2025-01-09 05:56:36,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:56:36,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:56:36,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:56:36,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:56:36,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,787 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:56:36,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:36,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:37,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:56:37,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:56:37,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:56:37,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:56:37,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (1/1) ... [2025-01-09 05:56:37,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:37,087 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:56:37,098 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:56:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:56:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:56:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:56:37,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:56:37,224 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:56:37,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:56:41,592 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-09 05:56:41,592 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:56:41,623 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:56:41,623 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:56:41,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:56:41 BoogieIcfgContainer [2025-01-09 05:56:41,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:56:41,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:56:41,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:56:41,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:56:41,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:56:34" (1/3) ... [2025-01-09 05:56:41,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5144fe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:56:41, skipping insertion in model container [2025-01-09 05:56:41,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:36" (2/3) ... [2025-01-09 05:56:41,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5144fe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:56:41, skipping insertion in model container [2025-01-09 05:56:41,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:56:41" (3/3) ... [2025-01-09 05:56:41,637 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label04.c [2025-01-09 05:56:41,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:56:41,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label04.c that has 1 procedures, 929 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:56:41,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:56:41,728 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;@41967970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:56:41,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:56:41,735 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:56:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:56:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:41,740 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:56:41,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 460735637, now seen corresponding path program 1 times [2025-01-09 05:56:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476101727] [2025-01-09 05:56:41,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:56:41,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:56:41,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:41,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:41,989 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:56:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476101727] [2025-01-09 05:56:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476101727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:56:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425132455] [2025-01-09 05:56:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:41,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:56:41,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:42,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:56:42,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:56:42,008 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:56:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:42,074 INFO L93 Difference]: Finished difference Result 1802 states and 3416 transitions. [2025-01-09 05:56:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:56:42,076 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:56:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:42,085 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 05:56:42,085 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 05:56:42,089 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:56:42,091 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:56:42,091 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:56:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 05:56:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-01-09 05:56:42,142 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:56:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2025-01-09 05:56:42,148 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2025-01-09 05:56:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2025-01-09 05:56:42,149 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:56:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2025-01-09 05:56:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:56:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:42,150 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:56:42,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:56:42,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:42,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 679590355, now seen corresponding path program 1 times [2025-01-09 05:56:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255837585] [2025-01-09 05:56:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:42,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:56:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:56:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:42,359 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:56:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255837585] [2025-01-09 05:56:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255837585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:42,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:42,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:56:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273475753] [2025-01-09 05:56:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:42,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:56:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:42,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:56:42,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:56:42,362 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:56:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:42,644 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2025-01-09 05:56:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:56:42,646 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:56:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:42,660 INFO L225 Difference]: With dead ends: 922 [2025-01-09 05:56:42,661 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 05:56:42,664 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:56:42,664 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:42,664 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.2s Time] [2025-01-09 05:56:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 05:56:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-01-09 05:56:42,786 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:56:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2025-01-09 05:56:42,797 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2025-01-09 05:56:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:42,797 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2025-01-09 05:56:42,797 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:56:42,797 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2025-01-09 05:56:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:56:42,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:42,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:42,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:56:42,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 433495105, now seen corresponding path program 1 times [2025-01-09 05:56:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351944717] [2025-01-09 05:56:42,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:56:42,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:56:42,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:42,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:43,044 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:56:43,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351944717] [2025-01-09 05:56:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351944717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394060318] [2025-01-09 05:56:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:56:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:56:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:56:43,047 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:48,283 INFO L93 Difference]: Finished difference Result 3119 states and 5891 transitions. [2025-01-09 05:56:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:56:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 05:56:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:48,308 INFO L225 Difference]: With dead ends: 3119 [2025-01-09 05:56:48,312 INFO L226 Difference]: Without dead ends: 2366 [2025-01-09 05:56:48,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:56:48,314 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2483 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2483 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:48,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2483 Valid, 854 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 05:56:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-01-09 05:56:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2025-01-09 05:56:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5050761421319796) internal successors, (3558), 2365 states have internal predecessors, (3558), 0 states have call successors, (0), 0 states have 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:56:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3558 transitions. [2025-01-09 05:56:48,399 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3558 transitions. Word has length 61 [2025-01-09 05:56:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3558 transitions. [2025-01-09 05:56:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3558 transitions. [2025-01-09 05:56:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:56:48,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:48,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:48,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:56:48,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:48,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash -620307086, now seen corresponding path program 1 times [2025-01-09 05:56:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425656591] [2025-01-09 05:56:48,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:56:48,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:56:48,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:48,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:48,883 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:56:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425656591] [2025-01-09 05:56:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425656591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:48,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:48,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:56:48,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167586290] [2025-01-09 05:56:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:48,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:56:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:48,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:56:48,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:56:48,888 INFO L87 Difference]: Start difference. First operand 2366 states and 3558 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:56:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:49,220 INFO L93 Difference]: Finished difference Result 3122 states and 4776 transitions. [2025-01-09 05:56:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:56:49,221 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:56:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:49,229 INFO L225 Difference]: With dead ends: 3122 [2025-01-09 05:56:49,230 INFO L226 Difference]: Without dead ends: 3068 [2025-01-09 05:56:49,231 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:56:49,231 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11506 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:49,231 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.1s Time] [2025-01-09 05:56:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-01-09 05:56:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2418. [2025-01-09 05:56:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5074503311258278) internal successors, (3642), 2417 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have 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:56:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3642 transitions. [2025-01-09 05:56:49,267 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3642 transitions. Word has length 77 [2025-01-09 05:56:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:49,267 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3642 transitions. [2025-01-09 05:56:49,268 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:56:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3642 transitions. [2025-01-09 05:56:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:56:49,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:49,269 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:56:49,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:56:49,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:49,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash -530347134, now seen corresponding path program 1 times [2025-01-09 05:56:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372792138] [2025-01-09 05:56:49,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:49,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:56:49,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:56:49,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:49,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:49,360 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:56:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372792138] [2025-01-09 05:56:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372792138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321475369] [2025-01-09 05:56:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:49,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:49,361 INFO L87 Difference]: Start difference. First operand 2418 states and 3642 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:56:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:49,385 INFO L93 Difference]: Finished difference Result 2619 states and 3965 transitions. [2025-01-09 05:56:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:49,386 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:56:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:49,394 INFO L225 Difference]: With dead ends: 2619 [2025-01-09 05:56:49,394 INFO L226 Difference]: Without dead ends: 2513 [2025-01-09 05:56:49,394 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:56:49,396 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:56:49,397 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:56:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-01-09 05:56:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2025-01-09 05:56:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5105619768832204) internal successors, (3790), 2510 states have internal predecessors, (3790), 0 states have call successors, (0), 0 states have 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:56:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3790 transitions. [2025-01-09 05:56:49,434 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3790 transitions. Word has length 79 [2025-01-09 05:56:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:49,434 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3790 transitions. [2025-01-09 05:56:49,434 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:56:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3790 transitions. [2025-01-09 05:56:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:56:49,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:49,435 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:56:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:56:49,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -463853622, now seen corresponding path program 1 times [2025-01-09 05:56:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101851636] [2025-01-09 05:56:49,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:49,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:56:49,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:56:49,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:49,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:49,901 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:56:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101851636] [2025-01-09 05:56:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101851636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:56:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183404449] [2025-01-09 05:56:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:56:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:49,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:56:49,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:56:49,904 INFO L87 Difference]: Start difference. First operand 2511 states and 3790 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:56:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,177 INFO L93 Difference]: Finished difference Result 2712 states and 4110 transitions. [2025-01-09 05:56:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:56:50,177 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:56:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,186 INFO L225 Difference]: With dead ends: 2712 [2025-01-09 05:56:50,186 INFO L226 Difference]: Without dead ends: 2513 [2025-01-09 05:56:50,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:56:50,188 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 7555 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7555 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:50,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7555 Valid, 2077 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-01-09 05:56:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2025-01-09 05:56:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5097648465524114) internal successors, (3788), 2510 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have 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:56:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3788 transitions. [2025-01-09 05:56:50,236 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3788 transitions. Word has length 79 [2025-01-09 05:56:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,236 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3788 transitions. [2025-01-09 05:56:50,236 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:56:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3788 transitions. [2025-01-09 05:56:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:56:50,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,237 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:56:50,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:56:50,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1909283312, now seen corresponding path program 1 times [2025-01-09 05:56:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578269959] [2025-01-09 05:56:50,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:56:50,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:56:50,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,497 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:56:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578269959] [2025-01-09 05:56:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578269959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440360933] [2025-01-09 05:56:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:50,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:50,501 INFO L87 Difference]: Start difference. First operand 2511 states and 3788 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:56:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,579 INFO L93 Difference]: Finished difference Result 2519 states and 3797 transitions. [2025-01-09 05:56:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:50,580 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:56:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,588 INFO L225 Difference]: With dead ends: 2519 [2025-01-09 05:56:50,588 INFO L226 Difference]: Without dead ends: 2517 [2025-01-09 05:56:50,590 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:56:50,591 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:56:50,591 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:56:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2025-01-09 05:56:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2025-01-09 05:56:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5081510934393638) internal successors, (3793), 2516 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have 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:56:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3793 transitions. [2025-01-09 05:56:50,645 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3793 transitions. Word has length 80 [2025-01-09 05:56:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,646 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3793 transitions. [2025-01-09 05:56:50,647 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:56:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3793 transitions. [2025-01-09 05:56:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:50,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:56:50,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash -789777814, now seen corresponding path program 1 times [2025-01-09 05:56:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243043309] [2025-01-09 05:56:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:50,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243043309] [2025-01-09 05:56:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243043309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832144470] [2025-01-09 05:56:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:50,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:50,721 INFO L87 Difference]: Start difference. First operand 2517 states and 3793 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:56:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,762 INFO L93 Difference]: Finished difference Result 2735 states and 4134 transitions. [2025-01-09 05:56:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:50,763 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:56:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,774 INFO L225 Difference]: With dead ends: 2735 [2025-01-09 05:56:50,774 INFO L226 Difference]: Without dead ends: 2623 [2025-01-09 05:56:50,776 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:56:50,777 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:56:50,777 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:56:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-01-09 05:56:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2621. [2025-01-09 05:56:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 1.5097365406643757) internal successors, (3954), 2620 states have internal predecessors, (3954), 0 states have call successors, (0), 0 states have 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:56:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3954 transitions. [2025-01-09 05:56:50,848 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3954 transitions. Word has length 81 [2025-01-09 05:56:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 3954 transitions. [2025-01-09 05:56:50,849 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:56:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3954 transitions. [2025-01-09 05:56:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:50,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,851 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:56:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:56:50,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1315206250, now seen corresponding path program 1 times [2025-01-09 05:56:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774756077] [2025-01-09 05:56:50,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:50,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:50,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,931 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:56:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774756077] [2025-01-09 05:56:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774756077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31278601] [2025-01-09 05:56:50,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:50,933 INFO L87 Difference]: Start difference. First operand 2621 states and 3954 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:56:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,978 INFO L93 Difference]: Finished difference Result 3211 states and 4874 transitions. [2025-01-09 05:56:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:50,979 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:56:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,990 INFO L225 Difference]: With dead ends: 3211 [2025-01-09 05:56:50,990 INFO L226 Difference]: Without dead ends: 2904 [2025-01-09 05:56:50,992 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:56:50,993 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:56:50,993 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:56:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2025-01-09 05:56:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2902. [2025-01-09 05:56:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2900 states have (on average 1.5124137931034483) internal successors, (4386), 2901 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have 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:56:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 4386 transitions. [2025-01-09 05:56:51,067 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 4386 transitions. Word has length 81 [2025-01-09 05:56:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:51,067 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 4386 transitions. [2025-01-09 05:56:51,068 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:56:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 4386 transitions. [2025-01-09 05:56:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:51,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:51,069 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:56:51,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:56:51,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1579062634, now seen corresponding path program 1 times [2025-01-09 05:56:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123038876] [2025-01-09 05:56:51,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:51,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:51,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:51,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,145 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:56:51,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:51,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123038876] [2025-01-09 05:56:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123038876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845309138] [2025-01-09 05:56:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:51,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:51,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:51,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:51,147 INFO L87 Difference]: Start difference. First operand 2902 states and 4386 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:56:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:51,199 INFO L93 Difference]: Finished difference Result 4030 states and 6128 transitions. [2025-01-09 05:56:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:51,199 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:56:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:51,212 INFO L225 Difference]: With dead ends: 4030 [2025-01-09 05:56:51,213 INFO L226 Difference]: Without dead ends: 3442 [2025-01-09 05:56:51,214 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:56:51,215 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:56:51,215 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:56:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-01-09 05:56:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3440. [2025-01-09 05:56:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3438 states have (on average 1.513089005235602) internal successors, (5202), 3439 states have internal predecessors, (5202), 0 states have call successors, (0), 0 states have 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:56:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 5202 transitions. [2025-01-09 05:56:51,288 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 5202 transitions. Word has length 81 [2025-01-09 05:56:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:51,289 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 5202 transitions. [2025-01-09 05:56:51,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:56:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 5202 transitions. [2025-01-09 05:56:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:51,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:51,290 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:56:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:56:51,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1477642646, now seen corresponding path program 1 times [2025-01-09 05:56:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524687138] [2025-01-09 05:56:51,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:51,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:51,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:51,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524687138] [2025-01-09 05:56:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524687138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321457668] [2025-01-09 05:56:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:51,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:51,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:51,364 INFO L87 Difference]: Start difference. First operand 3440 states and 5202 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:56:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:51,408 INFO L93 Difference]: Finished difference Result 5596 states and 8492 transitions. [2025-01-09 05:56:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:51,409 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:56:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:51,419 INFO L225 Difference]: With dead ends: 5596 [2025-01-09 05:56:51,419 INFO L226 Difference]: Without dead ends: 4470 [2025-01-09 05:56:51,422 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:56:51,422 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:56:51,426 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:56:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2025-01-09 05:56:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4468. [2025-01-09 05:56:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4466 states have (on average 1.5087326466636812) internal successors, (6738), 4467 states have internal predecessors, (6738), 0 states have call successors, (0), 0 states have 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:56:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 6738 transitions. [2025-01-09 05:56:51,514 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 6738 transitions. Word has length 81 [2025-01-09 05:56:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:51,514 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 6738 transitions. [2025-01-09 05:56:51,515 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:56:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 6738 transitions. [2025-01-09 05:56:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:51,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:51,516 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:56:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:56:51,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 601855850, now seen corresponding path program 1 times [2025-01-09 05:56:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229424265] [2025-01-09 05:56:51,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:51,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:51,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:51,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:51,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:51,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,594 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:56:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229424265] [2025-01-09 05:56:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229424265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887590903] [2025-01-09 05:56:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:51,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:51,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:51,597 INFO L87 Difference]: Start difference. First operand 4468 states and 6738 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:56:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:51,660 INFO L93 Difference]: Finished difference Result 8584 states and 12932 transitions. [2025-01-09 05:56:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:51,661 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:56:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:51,675 INFO L225 Difference]: With dead ends: 8584 [2025-01-09 05:56:51,676 INFO L226 Difference]: Without dead ends: 6430 [2025-01-09 05:56:51,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:51,681 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:56:51,681 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:56:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2025-01-09 05:56:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 6428. [2025-01-09 05:56:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6428 states, 6426 states have (on average 1.4967320261437909) internal successors, (9618), 6427 states have internal predecessors, (9618), 0 states have call successors, (0), 0 states have 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:56:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6428 states to 6428 states and 9618 transitions. [2025-01-09 05:56:51,806 INFO L78 Accepts]: Start accepts. Automaton has 6428 states and 9618 transitions. Word has length 81 [2025-01-09 05:56:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:51,806 INFO L471 AbstractCegarLoop]: Abstraction has 6428 states and 9618 transitions. [2025-01-09 05:56:51,806 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:56:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9618 transitions. [2025-01-09 05:56:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:51,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:51,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:56:51,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1912178582, now seen corresponding path program 1 times [2025-01-09 05:56:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909417603] [2025-01-09 05:56:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:51,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:51,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,859 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:56:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909417603] [2025-01-09 05:56:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909417603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714578008] [2025-01-09 05:56:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:51,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:51,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:51,862 INFO L87 Difference]: Start difference. First operand 6428 states and 9618 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:56:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:51,957 INFO L93 Difference]: Finished difference Result 14272 states and 21236 transitions. [2025-01-09 05:56:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:51,958 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:56:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:51,978 INFO L225 Difference]: With dead ends: 14272 [2025-01-09 05:56:51,978 INFO L226 Difference]: Without dead ends: 10158 [2025-01-09 05:56:51,984 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:56:51,985 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:56:51,985 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:56:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2025-01-09 05:56:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 10156. [2025-01-09 05:56:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10156 states, 10154 states have (on average 1.4766594445538703) internal successors, (14994), 10155 states have internal predecessors, (14994), 0 states have call successors, (0), 0 states have 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:56:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 14994 transitions. [2025-01-09 05:56:52,259 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 14994 transitions. Word has length 81 [2025-01-09 05:56:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:52,259 INFO L471 AbstractCegarLoop]: Abstraction has 10156 states and 14994 transitions. [2025-01-09 05:56:52,259 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:56:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 14994 transitions. [2025-01-09 05:56:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:56:52,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:52,261 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:56:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:56:52,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:52,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1152291690, now seen corresponding path program 1 times [2025-01-09 05:56:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:52,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979961320] [2025-01-09 05:56:52,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:56:52,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:56:52,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:52,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:52,312 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:56:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:52,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979961320] [2025-01-09 05:56:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979961320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928474838] [2025-01-09 05:56:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:52,314 INFO L87 Difference]: Start difference. First operand 10156 states and 14994 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:56:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:52,475 INFO L93 Difference]: Finished difference Result 25072 states and 36692 transitions. [2025-01-09 05:56:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:52,476 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:56:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:52,506 INFO L225 Difference]: With dead ends: 25072 [2025-01-09 05:56:52,506 INFO L226 Difference]: Without dead ends: 17230 [2025-01-09 05:56:52,519 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:56:52,520 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:56:52,520 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:56:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17230 states. [2025-01-09 05:56:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17230 to 17228. [2025-01-09 05:56:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17228 states, 17226 states have (on average 1.450017415534657) internal successors, (24978), 17227 states have internal predecessors, (24978), 0 states have call successors, (0), 0 states have 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:56:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 24978 transitions. [2025-01-09 05:56:53,090 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 24978 transitions. Word has length 81 [2025-01-09 05:56:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:53,091 INFO L471 AbstractCegarLoop]: Abstraction has 17228 states and 24978 transitions. [2025-01-09 05:56:53,091 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:56:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 24978 transitions. [2025-01-09 05:56:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:56:53,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:53,096 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:56:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:56:53,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:53,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1255535689, now seen corresponding path program 1 times [2025-01-09 05:56:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948311037] [2025-01-09 05:56:53,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:53,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:53,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:53,335 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:56:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948311037] [2025-01-09 05:56:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948311037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:56:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221505644] [2025-01-09 05:56:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:56:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:53,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:56:53,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:56:53,337 INFO L87 Difference]: Start difference. First operand 17228 states and 24978 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:56:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:54,949 INFO L93 Difference]: Finished difference Result 120284 states and 173466 transitions. [2025-01-09 05:56:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:56:54,950 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:56:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:55,201 INFO L225 Difference]: With dead ends: 120284 [2025-01-09 05:56:55,202 INFO L226 Difference]: Without dead ends: 109786 [2025-01-09 05:56:55,236 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:56:55,237 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:56:55,239 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:56:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109786 states. [2025-01-09 05:56:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109786 to 29964. [2025-01-09 05:56:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29964 states, 29962 states have (on average 1.4402910353113945) internal successors, (43154), 29963 states have internal predecessors, (43154), 0 states have call successors, (0), 0 states have 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:56:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 43154 transitions. [2025-01-09 05:56:56,412 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 43154 transitions. Word has length 104 [2025-01-09 05:56:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:56,412 INFO L471 AbstractCegarLoop]: Abstraction has 29964 states and 43154 transitions. [2025-01-09 05:56:56,413 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:56:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 43154 transitions. [2025-01-09 05:56:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:56:56,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:56,418 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:56:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:56:56,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash -934447543, now seen corresponding path program 1 times [2025-01-09 05:56:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508033712] [2025-01-09 05:56:56,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:56,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:56,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:56,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:56,591 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:56:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508033712] [2025-01-09 05:56:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508033712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:56,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:56,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:56:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117655162] [2025-01-09 05:56:56,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:56,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:56:56,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:56,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:56:56,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:56:56,592 INFO L87 Difference]: Start difference. First operand 29964 states and 43154 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:56:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:58,852 INFO L93 Difference]: Finished difference Result 135196 states and 194842 transitions. [2025-01-09 05:56:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:56:58,852 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:56:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:59,032 INFO L225 Difference]: With dead ends: 135196 [2025-01-09 05:56:59,032 INFO L226 Difference]: Without dead ends: 120282 [2025-01-09 05:56:59,059 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:56:59,060 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9861 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9861 SdHoareTripleChecker+Valid, 4529 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:56:59,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9861 Valid, 4529 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120282 states. [2025-01-09 05:57:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120282 to 50124. [2025-01-09 05:57:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50124 states, 50122 states have (on average 1.4343003072503093) internal successors, (71890), 50123 states have internal predecessors, (71890), 0 states have call successors, (0), 0 states have 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:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50124 states to 50124 states and 71890 transitions. [2025-01-09 05:57:00,691 INFO L78 Accepts]: Start accepts. Automaton has 50124 states and 71890 transitions. Word has length 104 [2025-01-09 05:57:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:00,692 INFO L471 AbstractCegarLoop]: Abstraction has 50124 states and 71890 transitions. [2025-01-09 05:57:00,692 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:57:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 50124 states and 71890 transitions. [2025-01-09 05:57:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:57:00,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:00,698 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:57:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:57:00,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -670591159, now seen corresponding path program 1 times [2025-01-09 05:57:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585609402] [2025-01-09 05:57:00,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:00,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:57:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:57:00,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:00,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:00,854 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:57:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:00,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585609402] [2025-01-09 05:57:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585609402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550900332] [2025-01-09 05:57:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:00,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:00,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:00,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:00,857 INFO L87 Difference]: Start difference. First operand 50124 states and 71890 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:57:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:04,146 INFO L93 Difference]: Finished difference Result 150108 states and 216154 transitions. [2025-01-09 05:57:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:04,147 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:57:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:04,369 INFO L225 Difference]: With dead ends: 150108 [2025-01-09 05:57:04,369 INFO L226 Difference]: Without dead ends: 135194 [2025-01-09 05:57:04,404 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:57:04,405 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9905 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9905 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:04,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9905 Valid, 4448 Invalid, 219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135194 states. [2025-01-09 05:57:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135194 to 65036. [2025-01-09 05:57:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65036 states, 65034 states have (on average 1.4331272872651228) internal successors, (93202), 65035 states have internal predecessors, (93202), 0 states have call successors, (0), 0 states have 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:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65036 states to 65036 states and 93202 transitions. [2025-01-09 05:57:06,746 INFO L78 Accepts]: Start accepts. Automaton has 65036 states and 93202 transitions. Word has length 104 [2025-01-09 05:57:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 65036 states and 93202 transitions. [2025-01-09 05:57:06,747 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:57:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 65036 states and 93202 transitions. [2025-01-09 05:57:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:57:06,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:06,754 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:57:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:57:06,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 567670857, now seen corresponding path program 1 times [2025-01-09 05:57:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636338857] [2025-01-09 05:57:06,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:57:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:57:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:06,974 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:57:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636338857] [2025-01-09 05:57:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636338857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:06,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135620246] [2025-01-09 05:57:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:06,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:06,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:06,976 INFO L87 Difference]: Start difference. First operand 65036 states and 93202 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:57:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:10,110 INFO L93 Difference]: Finished difference Result 165020 states and 237466 transitions. [2025-01-09 05:57:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:10,111 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:57:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:10,328 INFO L225 Difference]: With dead ends: 165020 [2025-01-09 05:57:10,329 INFO L226 Difference]: Without dead ends: 150106 [2025-01-09 05:57:10,366 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:57:10,367 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:57:10,367 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:57:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150106 states. [2025-01-09 05:57:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150106 to 79948. [2025-01-09 05:57:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79948 states, 79946 states have (on average 1.4323918645085432) internal successors, (114514), 79947 states have internal predecessors, (114514), 0 states have call successors, (0), 0 states have 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:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79948 states to 79948 states and 114514 transitions. [2025-01-09 05:57:13,468 INFO L78 Accepts]: Start accepts. Automaton has 79948 states and 114514 transitions. Word has length 104 [2025-01-09 05:57:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 79948 states and 114514 transitions. [2025-01-09 05:57:13,469 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:57:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 79948 states and 114514 transitions. [2025-01-09 05:57:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:57:13,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:13,479 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:57:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:57:13,480 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:13,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1647797943, now seen corresponding path program 1 times [2025-01-09 05:57:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846703362] [2025-01-09 05:57:13,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:57:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:57:13,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:13,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:13,676 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:57:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846703362] [2025-01-09 05:57:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846703362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841782506] [2025-01-09 05:57:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:13,678 INFO L87 Difference]: Start difference. First operand 79948 states and 114514 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:57:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:18,044 INFO L93 Difference]: Finished difference Result 179932 states and 258778 transitions. [2025-01-09 05:57:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:18,045 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:57:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:18,296 INFO L225 Difference]: With dead ends: 179932 [2025-01-09 05:57:18,297 INFO L226 Difference]: Without dead ends: 165018 [2025-01-09 05:57:18,349 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:57:18,349 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:57:18,350 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:57:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165018 states. [2025-01-09 05:57:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165018 to 94860. [2025-01-09 05:57:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94860 states, 94858 states have (on average 1.4318876636656899) internal successors, (135826), 94859 states have internal predecessors, (135826), 0 states have call successors, (0), 0 states have 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:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94860 states to 94860 states and 135826 transitions. [2025-01-09 05:57:21,867 INFO L78 Accepts]: Start accepts. Automaton has 94860 states and 135826 transitions. Word has length 104 [2025-01-09 05:57:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:21,867 INFO L471 AbstractCegarLoop]: Abstraction has 94860 states and 135826 transitions. [2025-01-09 05:57:21,867 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:57:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 94860 states and 135826 transitions. [2025-01-09 05:57:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:57:21,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:21,873 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:57:21,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:57:21,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 133134921, now seen corresponding path program 1 times [2025-01-09 05:57:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:21,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942531370] [2025-01-09 05:57:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:21,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:57:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:57:21,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:21,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:22,005 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:57:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942531370] [2025-01-09 05:57:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942531370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210635759] [2025-01-09 05:57:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:22,007 INFO L87 Difference]: Start difference. First operand 94860 states and 135826 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) [2025-01-09 05:57:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:25,924 INFO L93 Difference]: Finished difference Result 194844 states and 280090 transitions. [2025-01-09 05:57:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:25,924 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 104 [2025-01-09 05:57:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:26,219 INFO L225 Difference]: With dead ends: 194844 [2025-01-09 05:57:26,219 INFO L226 Difference]: Without dead ends: 179930 [2025-01-09 05:57:26,280 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:57:26,282 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9875 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9875 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:26,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9875 Valid, 4538 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179930 states.