./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i --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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i -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 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:14:18,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:14:18,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:14:18,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:14:18,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:14:18,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:14:18,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:14:18,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:14:18,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:14:18,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:14:18,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:14:18,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:14:18,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:14:18,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:14:18,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:14:18,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:18,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:18,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:18,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:14:18,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:14:18,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:14:18,643 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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2025-01-09 16:14:18,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:14:18,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:14:18,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:14:18,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:14:18,860 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:14:18,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-01-09 16:14:19,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb703298b/828f1a6f20844fdeb538d3710dc5abd4/FLAGf93b33dba [2025-01-09 16:14:20,255 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:14:20,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-01-09 16:14:20,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb703298b/828f1a6f20844fdeb538d3710dc5abd4/FLAGf93b33dba [2025-01-09 16:14:20,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb703298b/828f1a6f20844fdeb538d3710dc5abd4 [2025-01-09 16:14:20,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:14:20,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:14:20,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:20,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:14:20,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:14:20,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8506b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20, skipping insertion in model container [2025-01-09 16:14:20,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:14:20,392 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2025-01-09 16:14:20,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:20,438 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:14:20,448 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2025-01-09 16:14:20,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:20,494 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:14:20,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20 WrapperNode [2025-01-09 16:14:20,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:20,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:20,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:14:20,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:14:20,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,547 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2025-01-09 16:14:20,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:20,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:14:20,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:14:20,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:14:20,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,575 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-01-09 16:14:20,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:14:20,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:14:20,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:14:20,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:14:20,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (1/1) ... [2025-01-09 16:14:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:20,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:20,626 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 16:14:20,631 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 16:14:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:14:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:14:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:14:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:14:20,729 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:14:20,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:14:21,168 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 16:14:21,168 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:14:21,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:14:21,180 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:14:21,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:21 BoogieIcfgContainer [2025-01-09 16:14:21,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:14:21,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:14:21,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:14:21,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:14:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:14:20" (1/3) ... [2025-01-09 16:14:21,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190b482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:21, skipping insertion in model container [2025-01-09 16:14:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:20" (2/3) ... [2025-01-09 16:14:21,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190b482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:21, skipping insertion in model container [2025-01-09 16:14:21,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:21" (3/3) ... [2025-01-09 16:14:21,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2025-01-09 16:14:21,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:14:21,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:14:21,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:14:21,254 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;@5ff80458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:14:21,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:14:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:14:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 16:14:21,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:21,268 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:21,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1050469246, now seen corresponding path program 1 times [2025-01-09 16:14:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312855162] [2025-01-09 16:14:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:21,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 16:14:21,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 16:14:21,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:14:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312855162] [2025-01-09 16:14:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312855162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483069134] [2025-01-09 16:14:21,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:21,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:21,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:21,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:14:21,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 16:14:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 16:14:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:14:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:14:21,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:21,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483069134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:21,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:14:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139426200] [2025-01-09 16:14:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:14:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:21,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:14:21,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:14:21,754 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:14:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:21,771 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-01-09 16:14:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:14:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-01-09 16:14:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:21,778 INFO L225 Difference]: With dead ends: 202 [2025-01-09 16:14:21,778 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 16:14:21,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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 16:14:21,783 INFO L435 NwaCegarLoop]: 144 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, 144 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 16:14:21,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 16:14:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 16:14:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:14:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-01-09 16:14:21,815 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-01-09 16:14:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-01-09 16:14:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:14:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-01-09 16:14:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 16:14:21,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:21,820 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:21,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:14:22,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:14:22,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2055984676, now seen corresponding path program 1 times [2025-01-09 16:14:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809392088] [2025-01-09 16:14:22,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:22,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 16:14:22,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 16:14:22,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:22,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809392088] [2025-01-09 16:14:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809392088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:22,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:22,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:14:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146954825] [2025-01-09 16:14:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:22,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:22,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:22,392 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:22,429 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-01-09 16:14:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:22,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 16:14:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:22,433 INFO L225 Difference]: With dead ends: 202 [2025-01-09 16:14:22,433 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 16:14:22,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:22,435 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:22,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 16:14:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-01-09 16:14:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:14:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-01-09 16:14:22,448 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-01-09 16:14:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:22,449 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-01-09 16:14:22,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-01-09 16:14:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 16:14:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:22,450 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:22,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:14:22,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash -463975258, now seen corresponding path program 1 times [2025-01-09 16:14:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371172188] [2025-01-09 16:14:22,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:22,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 16:14:22,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 16:14:22,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:22,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371172188] [2025-01-09 16:14:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371172188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:22,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:14:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089867342] [2025-01-09 16:14:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:22,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:22,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:22,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:22,598 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:22,622 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-01-09 16:14:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 16:14:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:22,624 INFO L225 Difference]: With dead ends: 206 [2025-01-09 16:14:22,624 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 16:14:22,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:22,625 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:22,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 16:14:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-01-09 16:14:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:14:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-01-09 16:14:22,633 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-01-09 16:14:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:22,633 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-01-09 16:14:22,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-01-09 16:14:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 16:14:22,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:22,635 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:14:22,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash -462128216, now seen corresponding path program 1 times [2025-01-09 16:14:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966840359] [2025-01-09 16:14:22,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:22,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 16:14:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 16:14:22,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966840359] [2025-01-09 16:14:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966840359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:14:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135835900] [2025-01-09 16:14:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:23,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:14:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:23,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:14:23,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:23,749 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:24,192 INFO L93 Difference]: Finished difference Result 241 states and 338 transitions. [2025-01-09 16:14:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:24,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2025-01-09 16:14:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:24,194 INFO L225 Difference]: With dead ends: 241 [2025-01-09 16:14:24,194 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 16:14:24,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:14:24,195 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:24,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 309 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 16:14:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2025-01-09 16:14:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 16:14:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2025-01-09 16:14:24,215 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 144 [2025-01-09 16:14:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:24,216 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2025-01-09 16:14:24,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2025-01-09 16:14:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 16:14:24,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:24,220 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:14:24,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:24,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash -698825796, now seen corresponding path program 1 times [2025-01-09 16:14:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872906927] [2025-01-09 16:14:24,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 16:14:24,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 16:14:24,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:24,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872906927] [2025-01-09 16:14:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872906927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:14:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875442360] [2025-01-09 16:14:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:14:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:27,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:14:27,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:14:27,516 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:14:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:29,103 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2025-01-09 16:14:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:14:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 145 [2025-01-09 16:14:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:29,110 INFO L225 Difference]: With dead ends: 371 [2025-01-09 16:14:29,110 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 16:14:29,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:14:29,111 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 521 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:29,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 474 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:14:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 16:14:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 204. [2025-01-09 16:14:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.2777777777777777) internal successors, (207), 164 states have internal predecessors, (207), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 16:14:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 281 transitions. [2025-01-09 16:14:29,143 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 281 transitions. Word has length 145 [2025-01-09 16:14:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:29,143 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 281 transitions. [2025-01-09 16:14:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:14:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 281 transitions. [2025-01-09 16:14:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 16:14:29,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:29,145 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:14:29,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1417715418, now seen corresponding path program 1 times [2025-01-09 16:14:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764759143] [2025-01-09 16:14:29,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:29,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 16:14:29,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 16:14:29,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:29,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764759143] [2025-01-09 16:14:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764759143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:14:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780662271] [2025-01-09 16:14:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:30,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:14:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:30,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:14:30,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:14:30,524 INFO L87 Difference]: Start difference. First operand 204 states and 281 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:30,993 INFO L93 Difference]: Finished difference Result 413 states and 571 transitions. [2025-01-09 16:14:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:30,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2025-01-09 16:14:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:30,995 INFO L225 Difference]: With dead ends: 413 [2025-01-09 16:14:30,995 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 16:14:30,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:14:30,996 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 375 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:30,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 395 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 16:14:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 206. [2025-01-09 16:14:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 166 states have internal predecessors, (208), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 16:14:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2025-01-09 16:14:31,018 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 282 transitions. Word has length 146 [2025-01-09 16:14:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 282 transitions. [2025-01-09 16:14:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 282 transitions. [2025-01-09 16:14:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 16:14:31,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:31,020 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:14:31,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1799475948, now seen corresponding path program 1 times [2025-01-09 16:14:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928967347] [2025-01-09 16:14:31,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:31,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 16:14:31,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 16:14:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928967347] [2025-01-09 16:14:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928967347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:32,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:32,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:14:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768523335] [2025-01-09 16:14:32,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:32,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:14:32,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:32,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:14:32,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:32,480 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:14:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:33,465 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2025-01-09 16:14:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:14:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-01-09 16:14:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:33,467 INFO L225 Difference]: With dead ends: 511 [2025-01-09 16:14:33,467 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 16:14:33,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:14:33,470 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 346 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:33,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 503 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:14:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 16:14:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2025-01-09 16:14:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 272 states have internal predecessors, (344), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 454 transitions. [2025-01-09 16:14:33,508 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 454 transitions. Word has length 146 [2025-01-09 16:14:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:33,508 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 454 transitions. [2025-01-09 16:14:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:14:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 454 transitions. [2025-01-09 16:14:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 16:14:33,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:33,510 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:14:33,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 855055521, now seen corresponding path program 1 times [2025-01-09 16:14:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466836360] [2025-01-09 16:14:33,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:33,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:33,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 16:14:33,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 16:14:33,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:33,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466836360] [2025-01-09 16:14:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466836360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:34,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:34,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:14:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187330655] [2025-01-09 16:14:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:14:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:34,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:14:34,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:14:34,748 INFO L87 Difference]: Start difference. First operand 330 states and 454 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:35,384 INFO L93 Difference]: Finished difference Result 666 states and 918 transitions. [2025-01-09 16:14:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:14:35,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2025-01-09 16:14:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:35,386 INFO L225 Difference]: With dead ends: 666 [2025-01-09 16:14:35,386 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 16:14:35,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:14:35,387 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 312 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:35,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 626 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 16:14:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 335. [2025-01-09 16:14:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 273 states have (on average 1.2857142857142858) internal successors, (351), 277 states have internal predecessors, (351), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 461 transitions. [2025-01-09 16:14:35,423 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 461 transitions. Word has length 146 [2025-01-09 16:14:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:35,423 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 461 transitions. [2025-01-09 16:14:35,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 461 transitions. [2025-01-09 16:14:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:35,424 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:14:35,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1240493290, now seen corresponding path program 1 times [2025-01-09 16:14:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818804173] [2025-01-09 16:14:35,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:35,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:35,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:36,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818804173] [2025-01-09 16:14:36,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818804173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:36,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:36,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:14:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493924191] [2025-01-09 16:14:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:36,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:14:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:36,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:14:36,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:36,696 INFO L87 Difference]: Start difference. First operand 335 states and 461 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:14:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:37,373 INFO L93 Difference]: Finished difference Result 728 states and 1002 transitions. [2025-01-09 16:14:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:14:37,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-01-09 16:14:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:37,378 INFO L225 Difference]: With dead ends: 728 [2025-01-09 16:14:37,378 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 16:14:37,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:14:37,380 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 494 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:37,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 591 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 16:14:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 365. [2025-01-09 16:14:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 303 states have (on average 1.2937293729372936) internal successors, (392), 307 states have internal predecessors, (392), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 502 transitions. [2025-01-09 16:14:37,464 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 502 transitions. Word has length 147 [2025-01-09 16:14:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:37,464 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 502 transitions. [2025-01-09 16:14:37,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:14:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 502 transitions. [2025-01-09 16:14:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:37,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:37,466 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:37,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:14:37,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1774610328, now seen corresponding path program 1 times [2025-01-09 16:14:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:37,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994450198] [2025-01-09 16:14:37,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:37,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:37,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:37,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:37,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994450198] [2025-01-09 16:14:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994450198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:14:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215480712] [2025-01-09 16:14:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:42,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:14:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:42,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:14:42,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:14:42,506 INFO L87 Difference]: Start difference. First operand 365 states and 502 transitions. Second operand has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:14:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:45,597 INFO L93 Difference]: Finished difference Result 870 states and 1179 transitions. [2025-01-09 16:14:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:14:45,598 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 147 [2025-01-09 16:14:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:45,602 INFO L225 Difference]: With dead ends: 870 [2025-01-09 16:14:45,602 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 16:14:45,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:14:45,604 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 479 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:45,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 948 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 16:14:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 16:14:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 455. [2025-01-09 16:14:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 386 states have (on average 1.2927461139896372) internal successors, (499), 392 states have internal predecessors, (499), 59 states have call successors, (59), 9 states have call predecessors, (59), 9 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:14:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 617 transitions. [2025-01-09 16:14:45,666 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 617 transitions. Word has length 147 [2025-01-09 16:14:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 617 transitions. [2025-01-09 16:14:45,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:14:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 617 transitions. [2025-01-09 16:14:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:45,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:45,672 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:14:45,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1279772682, now seen corresponding path program 1 times [2025-01-09 16:14:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909008509] [2025-01-09 16:14:45,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:45,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:47,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909008509] [2025-01-09 16:14:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909008509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:47,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:47,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:14:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714913525] [2025-01-09 16:14:47,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:14:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:47,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:14:47,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:14:47,099 INFO L87 Difference]: Start difference. First operand 455 states and 617 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:47,659 INFO L93 Difference]: Finished difference Result 945 states and 1286 transitions. [2025-01-09 16:14:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2025-01-09 16:14:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:47,666 INFO L225 Difference]: With dead ends: 945 [2025-01-09 16:14:47,667 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 16:14:47,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:14:47,668 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 437 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:47,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 322 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 16:14:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 459. [2025-01-09 16:14:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 390 states have (on average 1.2897435897435898) internal successors, (503), 396 states have internal predecessors, (503), 59 states have call successors, (59), 9 states have call predecessors, (59), 9 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:14:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 621 transitions. [2025-01-09 16:14:47,728 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 621 transitions. Word has length 147 [2025-01-09 16:14:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 621 transitions. [2025-01-09 16:14:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 621 transitions. [2025-01-09 16:14:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:47,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:47,730 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:47,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:14:47,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1099944680, now seen corresponding path program 1 times [2025-01-09 16:14:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094045690] [2025-01-09 16:14:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:47,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:47,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:47,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:47,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:51,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094045690] [2025-01-09 16:14:51,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094045690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:51,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:14:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156292596] [2025-01-09 16:14:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:14:51,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:51,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:14:51,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:14:51,266 INFO L87 Difference]: Start difference. First operand 459 states and 621 transitions. Second operand has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:14:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:53,256 INFO L93 Difference]: Finished difference Result 984 states and 1323 transitions. [2025-01-09 16:14:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:14:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 147 [2025-01-09 16:14:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:53,259 INFO L225 Difference]: With dead ends: 984 [2025-01-09 16:14:53,259 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 16:14:53,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:14:53,260 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 409 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:53,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 640 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:14:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 16:14:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 395. [2025-01-09 16:14:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 330 states have (on average 1.2818181818181817) internal successors, (423), 334 states have internal predecessors, (423), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2025-01-09 16:14:53,317 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 533 transitions. Word has length 147 [2025-01-09 16:14:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:53,318 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 533 transitions. [2025-01-09 16:14:53,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.230769230769231) internal successors, (55), 16 states have internal predecessors, (55), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:14:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 533 transitions. [2025-01-09 16:14:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:53,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:53,319 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:14:53,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1915158938, now seen corresponding path program 1 times [2025-01-09 16:14:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428921885] [2025-01-09 16:14:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:53,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:53,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:53,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:53,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428921885] [2025-01-09 16:14:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428921885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:14:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122695289] [2025-01-09 16:14:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:53,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:14:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:14:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:14:53,915 INFO L87 Difference]: Start difference. First operand 395 states and 533 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:54,334 INFO L93 Difference]: Finished difference Result 814 states and 1100 transitions. [2025-01-09 16:14:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:14:54,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 16:14:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:54,338 INFO L225 Difference]: With dead ends: 814 [2025-01-09 16:14:54,338 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 16:14:54,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:54,340 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 189 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:54,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 790 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:14:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 16:14:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 395. [2025-01-09 16:14:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 330 states have (on average 1.2818181818181817) internal successors, (423), 334 states have internal predecessors, (423), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2025-01-09 16:14:54,447 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 533 transitions. Word has length 147 [2025-01-09 16:14:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:54,448 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 533 transitions. [2025-01-09 16:14:54,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:14:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 533 transitions. [2025-01-09 16:14:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:14:54,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:54,449 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:14:54,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:54,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1569810777, now seen corresponding path program 1 times [2025-01-09 16:14:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928438651] [2025-01-09 16:14:54,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:54,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:14:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:14:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:54,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928438651] [2025-01-09 16:14:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928438651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:14:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523086635] [2025-01-09 16:14:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:14:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:14:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:14:55,971 INFO L87 Difference]: Start difference. First operand 395 states and 533 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:56,646 INFO L93 Difference]: Finished difference Result 794 states and 1075 transitions. [2025-01-09 16:14:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:14:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2025-01-09 16:14:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:56,649 INFO L225 Difference]: With dead ends: 794 [2025-01-09 16:14:56,649 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 16:14:56,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:14:56,651 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 218 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:56,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 605 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:14:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 16:14:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2025-01-09 16:14:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 330 states have (on average 1.2818181818181817) internal successors, (423), 334 states have internal predecessors, (423), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 16:14:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2025-01-09 16:14:56,721 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 533 transitions. Word has length 147 [2025-01-09 16:14:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:56,721 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 533 transitions. [2025-01-09 16:14:56,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:14:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 533 transitions. [2025-01-09 16:14:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:14:56,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:56,722 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:14:56,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1801010010, now seen corresponding path program 1 times [2025-01-09 16:14:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104273999] [2025-01-09 16:14:56,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:56,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:14:56,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:14:56,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:56,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:14:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104273999] [2025-01-09 16:14:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104273999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:58,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:58,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:14:58,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206121125] [2025-01-09 16:14:58,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:14:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:58,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:14:58,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:58,729 INFO L87 Difference]: Start difference. First operand 395 states and 533 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:00,036 INFO L93 Difference]: Finished difference Result 971 states and 1315 transitions. [2025-01-09 16:15:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:15:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-01-09 16:15:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:00,041 INFO L225 Difference]: With dead ends: 971 [2025-01-09 16:15:00,041 INFO L226 Difference]: Without dead ends: 612 [2025-01-09 16:15:00,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:15:00,043 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 355 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:00,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 605 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:15:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-09 16:15:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 507. [2025-01-09 16:15:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 436 states have (on average 1.3004587155963303) internal successors, (567), 442 states have internal predecessors, (567), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 685 transitions. [2025-01-09 16:15:00,106 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 685 transitions. Word has length 148 [2025-01-09 16:15:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:00,107 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 685 transitions. [2025-01-09 16:15:00,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 685 transitions. [2025-01-09 16:15:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:00,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:00,108 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:00,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:15:00,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1472888932, now seen corresponding path program 1 times [2025-01-09 16:15:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875823762] [2025-01-09 16:15:00,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:00,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:00,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:00,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:00,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875823762] [2025-01-09 16:15:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875823762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:15:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824653623] [2025-01-09 16:15:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:01,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:15:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:01,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:15:01,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:15:01,328 INFO L87 Difference]: Start difference. First operand 507 states and 685 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:02,270 INFO L93 Difference]: Finished difference Result 1187 states and 1615 transitions. [2025-01-09 16:15:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:15:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2025-01-09 16:15:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:02,277 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 16:15:02,277 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 16:15:02,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:15:02,278 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 351 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 748 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:15:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 16:15:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 563. [2025-01-09 16:15:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 492 states have (on average 1.315040650406504) internal successors, (647), 498 states have internal predecessors, (647), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 765 transitions. [2025-01-09 16:15:02,354 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 765 transitions. Word has length 148 [2025-01-09 16:15:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:02,354 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 765 transitions. [2025-01-09 16:15:02,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 765 transitions. [2025-01-09 16:15:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:02,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:02,355 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:15:02,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:02,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:02,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1259235770, now seen corresponding path program 1 times [2025-01-09 16:15:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788065661] [2025-01-09 16:15:02,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:02,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:02,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:04,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788065661] [2025-01-09 16:15:04,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788065661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:04,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:04,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:15:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879635328] [2025-01-09 16:15:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:15:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:04,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:15:04,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:15:04,110 INFO L87 Difference]: Start difference. First operand 563 states and 765 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:05,005 INFO L93 Difference]: Finished difference Result 1227 states and 1664 transitions. [2025-01-09 16:15:05,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:15:05,005 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-01-09 16:15:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:05,008 INFO L225 Difference]: With dead ends: 1227 [2025-01-09 16:15:05,008 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 16:15:05,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:15:05,009 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 488 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:05,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 630 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:15:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 16:15:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 577. [2025-01-09 16:15:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 506 states have (on average 1.316205533596838) internal successors, (666), 512 states have internal predecessors, (666), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 784 transitions. [2025-01-09 16:15:05,076 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 784 transitions. Word has length 148 [2025-01-09 16:15:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:05,076 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 784 transitions. [2025-01-09 16:15:05,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 784 transitions. [2025-01-09 16:15:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:05,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:05,078 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:05,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:15:05,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:05,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1755867848, now seen corresponding path program 1 times [2025-01-09 16:15:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823191171] [2025-01-09 16:15:05,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:05,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:05,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:05,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:05,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823191171] [2025-01-09 16:15:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823191171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:15:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203155538] [2025-01-09 16:15:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:15:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:08,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:15:08,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:15:08,908 INFO L87 Difference]: Start difference. First operand 577 states and 784 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:15:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:10,256 INFO L93 Difference]: Finished difference Result 1260 states and 1701 transitions. [2025-01-09 16:15:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:15:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2025-01-09 16:15:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:10,259 INFO L225 Difference]: With dead ends: 1260 [2025-01-09 16:15:10,259 INFO L226 Difference]: Without dead ends: 719 [2025-01-09 16:15:10,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:15:10,260 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 279 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:10,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 529 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:15:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-01-09 16:15:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 556. [2025-01-09 16:15:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 485 states have (on average 1.3051546391752578) internal successors, (633), 491 states have internal predecessors, (633), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 751 transitions. [2025-01-09 16:15:10,331 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 751 transitions. Word has length 148 [2025-01-09 16:15:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:10,331 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 751 transitions. [2025-01-09 16:15:10,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:15:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 751 transitions. [2025-01-09 16:15:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:10,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:10,332 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:10,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:15:10,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:10,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash -691116525, now seen corresponding path program 1 times [2025-01-09 16:15:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111225574] [2025-01-09 16:15:10,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:10,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:10,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:10,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111225574] [2025-01-09 16:15:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111225574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:11,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:11,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:15:11,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221897434] [2025-01-09 16:15:11,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:15:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:11,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:15:11,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:15:11,920 INFO L87 Difference]: Start difference. First operand 556 states and 751 transitions. Second operand has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:13,203 INFO L93 Difference]: Finished difference Result 1168 states and 1576 transitions. [2025-01-09 16:15:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:15:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-01-09 16:15:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:13,206 INFO L225 Difference]: With dead ends: 1168 [2025-01-09 16:15:13,206 INFO L226 Difference]: Without dead ends: 648 [2025-01-09 16:15:13,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:15:13,207 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 231 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:13,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 657 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:15:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-09 16:15:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2025-01-09 16:15:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 557 states have (on average 1.2908438061041292) internal successors, (719), 565 states have internal predecessors, (719), 69 states have call successors, (69), 13 states have call predecessors, (69), 13 states have return successors, (69), 61 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 16:15:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 857 transitions. [2025-01-09 16:15:13,291 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 857 transitions. Word has length 148 [2025-01-09 16:15:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:13,291 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 857 transitions. [2025-01-09 16:15:13,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 857 transitions. [2025-01-09 16:15:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:13,293 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:15:13,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1197196156, now seen corresponding path program 1 times [2025-01-09 16:15:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548379621] [2025-01-09 16:15:13,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:13,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:13,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:17,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548379621] [2025-01-09 16:15:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548379621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:15:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508192591] [2025-01-09 16:15:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:17,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:15:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:15:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:15:17,323 INFO L87 Difference]: Start difference. First operand 640 states and 857 transitions. Second operand has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:15:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:18,856 INFO L93 Difference]: Finished difference Result 1365 states and 1820 transitions. [2025-01-09 16:15:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:15:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 148 [2025-01-09 16:15:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:18,859 INFO L225 Difference]: With dead ends: 1365 [2025-01-09 16:15:18,859 INFO L226 Difference]: Without dead ends: 761 [2025-01-09 16:15:18,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:15:18,860 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 301 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:18,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 582 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:15:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-01-09 16:15:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 558. [2025-01-09 16:15:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 487 states have (on average 1.299794661190965) internal successors, (633), 493 states have internal predecessors, (633), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 751 transitions. [2025-01-09 16:15:18,943 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 751 transitions. Word has length 148 [2025-01-09 16:15:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 751 transitions. [2025-01-09 16:15:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.0) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 16:15:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 751 transitions. [2025-01-09 16:15:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:18,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:18,944 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:15:18,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1817907462, now seen corresponding path program 1 times [2025-01-09 16:15:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656503454] [2025-01-09 16:15:18,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:18,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:19,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656503454] [2025-01-09 16:15:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656503454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:15:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190148209] [2025-01-09 16:15:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:15:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:15:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:15:19,432 INFO L87 Difference]: Start difference. First operand 558 states and 751 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:19,927 INFO L93 Difference]: Finished difference Result 1169 states and 1572 transitions. [2025-01-09 16:15:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:15:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 16:15:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:19,930 INFO L225 Difference]: With dead ends: 1169 [2025-01-09 16:15:19,930 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 16:15:19,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:15:19,931 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 144 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:19,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 858 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:15:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 16:15:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 549. [2025-01-09 16:15:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 478 states have (on average 1.3033472803347281) internal successors, (623), 484 states have internal predecessors, (623), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 741 transitions. [2025-01-09 16:15:20,049 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 741 transitions. Word has length 148 [2025-01-09 16:15:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:20,049 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 741 transitions. [2025-01-09 16:15:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 741 transitions. [2025-01-09 16:15:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:20,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:20,050 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:20,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:15:20,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 908171923, now seen corresponding path program 1 times [2025-01-09 16:15:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934505425] [2025-01-09 16:15:20,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:20,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:20,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:20,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:20,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934505425] [2025-01-09 16:15:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934505425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:15:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427751772] [2025-01-09 16:15:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:20,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:15:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:15:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:15:20,175 INFO L87 Difference]: Start difference. First operand 549 states and 741 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:20,338 INFO L93 Difference]: Finished difference Result 1122 states and 1516 transitions. [2025-01-09 16:15:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:15:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 16:15:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:20,341 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 16:15:20,341 INFO L226 Difference]: Without dead ends: 609 [2025-01-09 16:15:20,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:15:20,343 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:20,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 379 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:15:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-09 16:15:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 559. [2025-01-09 16:15:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 488 states have (on average 1.3012295081967213) internal successors, (635), 494 states have internal predecessors, (635), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 753 transitions. [2025-01-09 16:15:20,417 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 753 transitions. Word has length 148 [2025-01-09 16:15:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:20,417 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 753 transitions. [2025-01-09 16:15:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 753 transitions. [2025-01-09 16:15:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:20,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:20,418 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:15:20,418 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1685800635, now seen corresponding path program 1 times [2025-01-09 16:15:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027992139] [2025-01-09 16:15:20,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:20,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:20,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:20,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027992139] [2025-01-09 16:15:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027992139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:21,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:21,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:15:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401534048] [2025-01-09 16:15:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:21,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:15:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:21,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:15:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:15:21,155 INFO L87 Difference]: Start difference. First operand 559 states and 753 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:21,720 INFO L93 Difference]: Finished difference Result 1144 states and 1543 transitions. [2025-01-09 16:15:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:15:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-01-09 16:15:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:21,722 INFO L225 Difference]: With dead ends: 1144 [2025-01-09 16:15:21,722 INFO L226 Difference]: Without dead ends: 621 [2025-01-09 16:15:21,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:15:21,723 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 392 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:21,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 309 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:15:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-01-09 16:15:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 560. [2025-01-09 16:15:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 489 states have (on average 1.2985685071574642) internal successors, (635), 495 states have internal predecessors, (635), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 16:15:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 753 transitions. [2025-01-09 16:15:21,857 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 753 transitions. Word has length 148 [2025-01-09 16:15:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 753 transitions. [2025-01-09 16:15:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 753 transitions. [2025-01-09 16:15:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 16:15:21,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:21,858 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:15:21,859 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 97452733, now seen corresponding path program 1 times [2025-01-09 16:15:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936416440] [2025-01-09 16:15:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 16:15:21,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 16:15:21,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:21,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936416440] [2025-01-09 16:15:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936416440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:15:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989828877] [2025-01-09 16:15:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:15:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:15:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:15:22,655 INFO L87 Difference]: Start difference. First operand 560 states and 753 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:23,235 INFO L93 Difference]: Finished difference Result 1130 states and 1522 transitions. [2025-01-09 16:15:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:15:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2025-01-09 16:15:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:23,238 INFO L225 Difference]: With dead ends: 1130 [2025-01-09 16:15:23,238 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 16:15:23,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:15:23,239 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 341 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:23,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 431 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:15:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 16:15:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2025-01-09 16:15:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 523 states have (on average 1.2906309751434035) internal successors, (675), 530 states have internal predecessors, (675), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 809 transitions. [2025-01-09 16:15:23,343 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 809 transitions. Word has length 148 [2025-01-09 16:15:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:23,343 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 809 transitions. [2025-01-09 16:15:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 809 transitions. [2025-01-09 16:15:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:15:23,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:23,348 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:15:23,348 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -244252830, now seen corresponding path program 1 times [2025-01-09 16:15:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677820420] [2025-01-09 16:15:23,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:15:23,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:15:23,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677820420] [2025-01-09 16:15:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677820420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:15:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441053417] [2025-01-09 16:15:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:15:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:23,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:15:23,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:15:23,822 INFO L87 Difference]: Start difference. First operand 603 states and 809 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:24,161 INFO L93 Difference]: Finished difference Result 1169 states and 1569 transitions. [2025-01-09 16:15:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:15:24,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 16:15:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:24,164 INFO L225 Difference]: With dead ends: 1169 [2025-01-09 16:15:24,164 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 16:15:24,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:15:24,165 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 187 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:24,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 303 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:15:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 16:15:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 573. [2025-01-09 16:15:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 493 states have (on average 1.2677484787018256) internal successors, (625), 500 states have internal predecessors, (625), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 759 transitions. [2025-01-09 16:15:24,260 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 759 transitions. Word has length 149 [2025-01-09 16:15:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 759 transitions. [2025-01-09 16:15:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:15:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 759 transitions. [2025-01-09 16:15:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:15:24,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:24,263 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:24,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:15:24,263 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 737536132, now seen corresponding path program 1 times [2025-01-09 16:15:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488788129] [2025-01-09 16:15:24,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:24,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:15:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:15:24,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488788129] [2025-01-09 16:15:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488788129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 16:15:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992227728] [2025-01-09 16:15:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:15:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:26,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:15:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:15:26,777 INFO L87 Difference]: Start difference. First operand 573 states and 759 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:29,326 INFO L93 Difference]: Finished difference Result 1448 states and 1921 transitions. [2025-01-09 16:15:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:15:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-01-09 16:15:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:29,332 INFO L225 Difference]: With dead ends: 1448 [2025-01-09 16:15:29,332 INFO L226 Difference]: Without dead ends: 911 [2025-01-09 16:15:29,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:15:29,334 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 405 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:29,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1051 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 16:15:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-01-09 16:15:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 581. [2025-01-09 16:15:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 501 states have (on average 1.2794411177644711) internal successors, (641), 508 states have internal predecessors, (641), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 775 transitions. [2025-01-09 16:15:29,425 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 775 transitions. Word has length 149 [2025-01-09 16:15:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 775 transitions. [2025-01-09 16:15:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 775 transitions. [2025-01-09 16:15:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:15:29,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:29,426 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:29,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:15:29,426 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1160237958, now seen corresponding path program 1 times [2025-01-09 16:15:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131561291] [2025-01-09 16:15:29,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:29,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:15:29,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:15:29,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131561291] [2025-01-09 16:15:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131561291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:15:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080019546] [2025-01-09 16:15:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:15:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:31,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:15:31,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:15:31,117 INFO L87 Difference]: Start difference. First operand 581 states and 775 transitions. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:32,079 INFO L93 Difference]: Finished difference Result 1282 states and 1712 transitions. [2025-01-09 16:15:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:15:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-01-09 16:15:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:32,083 INFO L225 Difference]: With dead ends: 1282 [2025-01-09 16:15:32,083 INFO L226 Difference]: Without dead ends: 737 [2025-01-09 16:15:32,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:15:32,084 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 318 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:32,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 716 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:15:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-01-09 16:15:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 573. [2025-01-09 16:15:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 493 states have (on average 1.2677484787018256) internal successors, (625), 500 states have internal predecessors, (625), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 759 transitions. [2025-01-09 16:15:32,190 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 759 transitions. Word has length 149 [2025-01-09 16:15:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:32,190 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 759 transitions. [2025-01-09 16:15:32,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:15:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 759 transitions. [2025-01-09 16:15:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:15:32,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:32,199 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:32,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:15:32,199 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:32,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1425426376, now seen corresponding path program 1 times [2025-01-09 16:15:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118992566] [2025-01-09 16:15:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:15:32,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:15:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118992566] [2025-01-09 16:15:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118992566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:34,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:34,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:15:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18360470] [2025-01-09 16:15:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:34,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:15:34,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:34,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:15:34,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:15:34,232 INFO L87 Difference]: Start difference. First operand 573 states and 759 transitions. Second operand has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:35,112 INFO L93 Difference]: Finished difference Result 1207 states and 1600 transitions. [2025-01-09 16:15:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:15:35,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-01-09 16:15:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:35,115 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 16:15:35,115 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 16:15:35,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:15:35,117 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 348 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:35,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 520 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:15:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 16:15:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2025-01-09 16:15:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 540 states have (on average 1.2666666666666666) internal successors, (684), 547 states have internal predecessors, (684), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 818 transitions. [2025-01-09 16:15:35,208 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 818 transitions. Word has length 149 [2025-01-09 16:15:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 818 transitions. [2025-01-09 16:15:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:15:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 818 transitions. [2025-01-09 16:15:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 16:15:35,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:35,209 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 16:15:35,210 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1923351521, now seen corresponding path program 1 times [2025-01-09 16:15:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204130729] [2025-01-09 16:15:35,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:35,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 16:15:35,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 16:15:35,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:35,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204130729] [2025-01-09 16:15:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204130729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:15:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813318044] [2025-01-09 16:15:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:15:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:15:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:15:38,316 INFO L87 Difference]: Start difference. First operand 620 states and 818 transitions. Second operand has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:15:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:40,088 INFO L93 Difference]: Finished difference Result 1372 states and 1805 transitions. [2025-01-09 16:15:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:15:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 150 [2025-01-09 16:15:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:40,094 INFO L225 Difference]: With dead ends: 1372 [2025-01-09 16:15:40,094 INFO L226 Difference]: Without dead ends: 788 [2025-01-09 16:15:40,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:15:40,096 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 293 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:40,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 773 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:15:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-01-09 16:15:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 625. [2025-01-09 16:15:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 545 states have (on average 1.2642201834862385) internal successors, (689), 552 states have internal predecessors, (689), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 16:15:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 823 transitions. [2025-01-09 16:15:40,191 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 823 transitions. Word has length 150 [2025-01-09 16:15:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:40,192 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 823 transitions. [2025-01-09 16:15:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-09 16:15:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 823 transitions. [2025-01-09 16:15:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 16:15:40,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:40,193 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:15:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 16:15:40,193 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 638511703, now seen corresponding path program 1 times [2025-01-09 16:15:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:40,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398632455] [2025-01-09 16:15:40,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:40,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:40,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 16:15:40,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 16:15:40,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:40,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:15:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398632455] [2025-01-09 16:15:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398632455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:15:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83506088] [2025-01-09 16:15:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:15:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:43,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:15:43,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:15:43,304 INFO L87 Difference]: Start difference. First operand 625 states and 823 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19)