./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.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-s_file-27.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 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:56:08,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:56:08,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:56:08,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:56:08,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:56:08,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:56:08,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:56:08,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:56:08,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:56:08,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:56:08,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:56:08,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:56:08,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:56:08,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:56:08,376 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:56:08,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:56:08,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:56:08,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:08,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:08,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:08,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:56:08,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:56:08,380 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 -> 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 [2025-01-09 15:56:08,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:56:08,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:56:08,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:56:08,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:56:08,606 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:56:08,607 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-s_file-27.i [2025-01-09 15:56:09,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbe9fd156/6ba3bcdd80ae40129cceae824ec74dd7/FLAG42152ac25 [2025-01-09 15:56:09,950 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:56:09,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i [2025-01-09 15:56:09,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbe9fd156/6ba3bcdd80ae40129cceae824ec74dd7/FLAG42152ac25 [2025-01-09 15:56:10,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbe9fd156/6ba3bcdd80ae40129cceae824ec74dd7 [2025-01-09 15:56:10,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:56:10,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:56:10,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:10,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:56:10,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:56:10,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13369dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10, skipping insertion in model container [2025-01-09 15:56:10,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:56:10,358 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-s_file-27.i[916,929] [2025-01-09 15:56:10,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:10,395 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:56:10,402 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-s_file-27.i[916,929] [2025-01-09 15:56:10,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:10,448 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:56:10,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10 WrapperNode [2025-01-09 15:56:10,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:10,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:10,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:56:10,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:56:10,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,493 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-01-09 15:56:10,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:10,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:56:10,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:56:10,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:56:10,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,526 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-01-09 15:56:10,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:56:10,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:56:10,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:56:10,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:56:10,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (1/1) ... [2025-01-09 15:56:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:10,584 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 15:56:10,588 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 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:56:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:56:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:56:10,688 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:56:10,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:56:10,996 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-01-09 15:56:10,996 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:56:11,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:56:11,006 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:56:11,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:11 BoogieIcfgContainer [2025-01-09 15:56:11,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:56:11,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:56:11,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:56:11,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:56:11,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:10" (1/3) ... [2025-01-09 15:56:11,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d38ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:11, skipping insertion in model container [2025-01-09 15:56:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:10" (2/3) ... [2025-01-09 15:56:11,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d38ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:11, skipping insertion in model container [2025-01-09 15:56:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:11" (3/3) ... [2025-01-09 15:56:11,015 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-27.i [2025-01-09 15:56:11,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:56:11,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-27.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:56:11,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:56:11,073 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;@6066335c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:56:11,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:56:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:56:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:56:11,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:11,088 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:11,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:11,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2126897791, now seen corresponding path program 1 times [2025-01-09 15:56:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512557794] [2025-01-09 15:56:11,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:56:11,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:56:11,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512557794] [2025-01-09 15:56:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512557794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:13,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:13,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:13,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736399092] [2025-01-09 15:56:13,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:13,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:13,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:13,322 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:13,645 INFO L93 Difference]: Finished difference Result 227 states and 350 transitions. [2025-01-09 15:56:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-01-09 15:56:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:13,653 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:56:13,653 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 15:56:13,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:13,659 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 55 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 576 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 15:56:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-01-09 15:56:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 113 states have internal predecessors, (153), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2025-01-09 15:56:13,700 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 131 [2025-01-09 15:56:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2025-01-09 15:56:13,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2025-01-09 15:56:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:56:13,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:13,704 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:13,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 15:56:13,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -155302214, now seen corresponding path program 1 times [2025-01-09 15:56:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269087525] [2025-01-09 15:56:13,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:13,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:56:13,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:56:13,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:13,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269087525] [2025-01-09 15:56:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269087525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480845575] [2025-01-09 15:56:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:14,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:14,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:14,344 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:14,691 INFO L93 Difference]: Finished difference Result 354 states and 505 transitions. [2025-01-09 15:56:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:56:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-01-09 15:56:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:14,694 INFO L225 Difference]: With dead ends: 354 [2025-01-09 15:56:14,694 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 15:56:14,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:14,695 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:14,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 415 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 15:56:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-01-09 15:56:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3426966292134832) internal successors, (239), 179 states have internal predecessors, (239), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2025-01-09 15:56:14,721 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 133 [2025-01-09 15:56:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:14,721 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2025-01-09 15:56:14,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2025-01-09 15:56:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:56:14,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:14,723 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:14,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:56:14,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:14,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 211280954, now seen corresponding path program 1 times [2025-01-09 15:56:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539304378] [2025-01-09 15:56:14,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:14,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:56:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:56:14,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:14,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539304378] [2025-01-09 15:56:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539304378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882704883] [2025-01-09 15:56:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:15,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:15,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:15,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:15,281 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:15,658 INFO L93 Difference]: Finished difference Result 411 states and 584 transitions. [2025-01-09 15:56:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:56:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-01-09 15:56:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:15,660 INFO L225 Difference]: With dead ends: 411 [2025-01-09 15:56:15,660 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 15:56:15,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:15,661 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:15,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 505 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 15:56:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2025-01-09 15:56:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:56:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2025-01-09 15:56:15,672 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 133 [2025-01-09 15:56:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:15,673 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2025-01-09 15:56:15,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2025-01-09 15:56:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:56:15,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:15,674 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:56:15,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1917120998, now seen corresponding path program 1 times [2025-01-09 15:56:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460750588] [2025-01-09 15:56:15,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:15,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:56:15,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:56:15,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:15,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460750588] [2025-01-09 15:56:16,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460750588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:16,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:16,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:16,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486178656] [2025-01-09 15:56:16,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:16,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:16,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:16,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:16,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:16,261 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:16,541 INFO L93 Difference]: Finished difference Result 479 states and 672 transitions. [2025-01-09 15:56:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-01-09 15:56:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:16,544 INFO L225 Difference]: With dead ends: 479 [2025-01-09 15:56:16,544 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 15:56:16,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:16,545 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 140 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:16,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 451 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 15:56:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2025-01-09 15:56:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 246 states have (on average 1.3170731707317074) internal successors, (324), 248 states have internal predecessors, (324), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:56:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2025-01-09 15:56:16,572 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 134 [2025-01-09 15:56:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:16,572 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2025-01-09 15:56:16,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2025-01-09 15:56:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:56:16,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:16,574 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:16,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:56:16,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:16,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1979160612, now seen corresponding path program 1 times [2025-01-09 15:56:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324377457] [2025-01-09 15:56:16,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:16,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:56:16,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:56:16,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:16,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324377457] [2025-01-09 15:56:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324377457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250630592] [2025-01-09 15:56:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:16,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:16,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:16,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:16,983 INFO L87 Difference]: Start difference. First operand 303 states and 424 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:17,272 INFO L93 Difference]: Finished difference Result 741 states and 1028 transitions. [2025-01-09 15:56:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:17,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-01-09 15:56:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:17,276 INFO L225 Difference]: With dead ends: 741 [2025-01-09 15:56:17,277 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 15:56:17,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:17,279 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 151 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:17,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 396 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 15:56:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 215. [2025-01-09 15:56:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.2971428571428572) internal successors, (227), 175 states have internal predecessors, (227), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:56:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 295 transitions. [2025-01-09 15:56:17,309 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 295 transitions. Word has length 134 [2025-01-09 15:56:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 295 transitions. [2025-01-09 15:56:17,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 295 transitions. [2025-01-09 15:56:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:17,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:17,312 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:17,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:56:17,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:17,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2006599767, now seen corresponding path program 1 times [2025-01-09 15:56:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851302220] [2025-01-09 15:56:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:17,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:17,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:17,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851302220] [2025-01-09 15:56:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851302220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779531745] [2025-01-09 15:56:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:18,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:18,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:18,411 INFO L87 Difference]: Start difference. First operand 215 states and 295 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:18,674 INFO L93 Difference]: Finished difference Result 555 states and 759 transitions. [2025-01-09 15:56:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:56:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-01-09 15:56:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:18,676 INFO L225 Difference]: With dead ends: 555 [2025-01-09 15:56:18,677 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 15:56:18,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:56:18,677 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:18,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 498 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 15:56:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 310. [2025-01-09 15:56:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 267 states have (on average 1.3108614232209739) internal successors, (350), 268 states have internal predecessors, (350), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 422 transitions. [2025-01-09 15:56:18,692 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 422 transitions. Word has length 135 [2025-01-09 15:56:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 422 transitions. [2025-01-09 15:56:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 422 transitions. [2025-01-09 15:56:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:18,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:18,694 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:56:18,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1863154105, now seen corresponding path program 1 times [2025-01-09 15:56:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303384320] [2025-01-09 15:56:18,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:18,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:18,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:18,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:18,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:19,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303384320] [2025-01-09 15:56:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303384320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:56:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649781933] [2025-01-09 15:56:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:56:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:19,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:56:19,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:19,902 INFO L87 Difference]: Start difference. First operand 310 states and 422 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:20,295 INFO L93 Difference]: Finished difference Result 712 states and 971 transitions. [2025-01-09 15:56:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:56:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-01-09 15:56:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:20,298 INFO L225 Difference]: With dead ends: 712 [2025-01-09 15:56:20,298 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 15:56:20,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:56:20,299 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:20,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 779 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 15:56:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 344. [2025-01-09 15:56:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 301 states have (on average 1.308970099667774) internal successors, (394), 302 states have internal predecessors, (394), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2025-01-09 15:56:20,319 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 135 [2025-01-09 15:56:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:20,319 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2025-01-09 15:56:20,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2025-01-09 15:56:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:20,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:20,320 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:20,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:56:20,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:20,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:20,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2121319543, now seen corresponding path program 1 times [2025-01-09 15:56:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480896389] [2025-01-09 15:56:20,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:20,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:20,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:20,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:20,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:20,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:20,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480896389] [2025-01-09 15:56:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480896389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:20,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:20,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173995280] [2025-01-09 15:56:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:20,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:20,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:20,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:20,972 INFO L87 Difference]: Start difference. First operand 344 states and 466 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:21,224 INFO L93 Difference]: Finished difference Result 753 states and 1019 transitions. [2025-01-09 15:56:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-01-09 15:56:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:21,227 INFO L225 Difference]: With dead ends: 753 [2025-01-09 15:56:21,229 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 15:56:21,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:21,230 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:21,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 550 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 15:56:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 347. [2025-01-09 15:56:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 304 states have (on average 1.305921052631579) internal successors, (397), 305 states have internal predecessors, (397), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 469 transitions. [2025-01-09 15:56:21,256 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 469 transitions. Word has length 135 [2025-01-09 15:56:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:21,256 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 469 transitions. [2025-01-09 15:56:21,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 469 transitions. [2025-01-09 15:56:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:21,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:21,257 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:21,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:56:21,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1045505655, now seen corresponding path program 1 times [2025-01-09 15:56:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600240153] [2025-01-09 15:56:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:21,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:21,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:21,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600240153] [2025-01-09 15:56:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600240153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:21,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:21,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004402363] [2025-01-09 15:56:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:21,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:21,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:21,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:21,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:21,870 INFO L87 Difference]: Start difference. First operand 347 states and 469 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:22,140 INFO L93 Difference]: Finished difference Result 731 states and 985 transitions. [2025-01-09 15:56:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-01-09 15:56:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:22,143 INFO L225 Difference]: With dead ends: 731 [2025-01-09 15:56:22,143 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 15:56:22,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:22,144 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 53 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:22,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 525 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 15:56:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 317. [2025-01-09 15:56:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 276 states have (on average 1.289855072463768) internal successors, (356), 276 states have internal predecessors, (356), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:56:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2025-01-09 15:56:22,168 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 424 transitions. Word has length 135 [2025-01-09 15:56:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 424 transitions. [2025-01-09 15:56:22,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 424 transitions. [2025-01-09 15:56:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:22,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:22,171 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:56:22,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1303671093, now seen corresponding path program 1 times [2025-01-09 15:56:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97271105] [2025-01-09 15:56:22,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:22,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:22,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:22,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:22,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97271105] [2025-01-09 15:56:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97271105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:56:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848275807] [2025-01-09 15:56:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:56:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:22,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:56:22,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:56:22,886 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:23,306 INFO L93 Difference]: Finished difference Result 662 states and 888 transitions. [2025-01-09 15:56:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:56:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-01-09 15:56:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:23,310 INFO L225 Difference]: With dead ends: 662 [2025-01-09 15:56:23,310 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 15:56:23,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:56:23,312 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:23,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 959 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 15:56:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 311. [2025-01-09 15:56:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 270 states have (on average 1.288888888888889) internal successors, (348), 270 states have internal predecessors, (348), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:56:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 416 transitions. [2025-01-09 15:56:23,329 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 416 transitions. Word has length 135 [2025-01-09 15:56:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 416 transitions. [2025-01-09 15:56:23,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 416 transitions. [2025-01-09 15:56:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:23,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:23,331 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:23,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:56:23,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:23,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1311729213, now seen corresponding path program 1 times [2025-01-09 15:56:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113234345] [2025-01-09 15:56:23,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:23,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:23,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:23,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:23,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113234345] [2025-01-09 15:56:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113234345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:23,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411900003] [2025-01-09 15:56:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:23,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:23,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:23,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:23,673 INFO L87 Difference]: Start difference. First operand 311 states and 416 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:23,933 INFO L93 Difference]: Finished difference Result 733 states and 977 transitions. [2025-01-09 15:56:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:23,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-01-09 15:56:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:23,936 INFO L225 Difference]: With dead ends: 733 [2025-01-09 15:56:23,936 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 15:56:23,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:23,936 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 73 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:23,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 400 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 15:56:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 329. [2025-01-09 15:56:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 288 states have (on average 1.2743055555555556) internal successors, (367), 288 states have internal predecessors, (367), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:56:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 435 transitions. [2025-01-09 15:56:23,957 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 435 transitions. Word has length 135 [2025-01-09 15:56:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:23,957 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 435 transitions. [2025-01-09 15:56:23,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2025-01-09 15:56:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:56:23,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:23,958 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:56:23,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2012793791, now seen corresponding path program 1 times [2025-01-09 15:56:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596301739] [2025-01-09 15:56:23,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:23,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:56:23,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:56:23,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:23,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596301739] [2025-01-09 15:56:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596301739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:24,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631942613] [2025-01-09 15:56:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:24,243 INFO L87 Difference]: Start difference. First operand 329 states and 435 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:24,503 INFO L93 Difference]: Finished difference Result 759 states and 998 transitions. [2025-01-09 15:56:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-01-09 15:56:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:24,505 INFO L225 Difference]: With dead ends: 759 [2025-01-09 15:56:24,505 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 15:56:24,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:24,506 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 124 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:24,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 479 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 15:56:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 429. [2025-01-09 15:56:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 362 states have (on average 1.2513812154696133) internal successors, (453), 364 states have internal predecessors, (453), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:56:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 561 transitions. [2025-01-09 15:56:24,531 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 561 transitions. Word has length 135 [2025-01-09 15:56:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:24,531 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 561 transitions. [2025-01-09 15:56:24,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2025-01-09 15:56:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:24,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:24,533 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:24,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:56:24,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1877860087, now seen corresponding path program 1 times [2025-01-09 15:56:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428111836] [2025-01-09 15:56:24,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:24,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:24,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:24,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:24,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428111836] [2025-01-09 15:56:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428111836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:24,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503393546] [2025-01-09 15:56:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:24,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:24,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:24,763 INFO L87 Difference]: Start difference. First operand 429 states and 561 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:24,982 INFO L93 Difference]: Finished difference Result 1000 states and 1305 transitions. [2025-01-09 15:56:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:56:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 15:56:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:24,985 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 15:56:24,985 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 15:56:24,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:56:24,986 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:24,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 608 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 15:56:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 570. [2025-01-09 15:56:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 487 states have (on average 1.24435318275154) internal successors, (606), 491 states have internal predecessors, (606), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:56:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 738 transitions. [2025-01-09 15:56:25,019 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 738 transitions. Word has length 139 [2025-01-09 15:56:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:25,019 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 738 transitions. [2025-01-09 15:56:25,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 738 transitions. [2025-01-09 15:56:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:25,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:25,021 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:25,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:56:25,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -66688512, now seen corresponding path program 1 times [2025-01-09 15:56:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806431593] [2025-01-09 15:56:25,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806431593] [2025-01-09 15:56:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806431593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:25,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:56:25,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145978141] [2025-01-09 15:56:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:56:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:25,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:56:25,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:56:25,668 INFO L87 Difference]: Start difference. First operand 570 states and 738 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:56:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:26,464 INFO L93 Difference]: Finished difference Result 1463 states and 1881 transitions. [2025-01-09 15:56:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:56:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-01-09 15:56:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:26,469 INFO L225 Difference]: With dead ends: 1463 [2025-01-09 15:56:26,469 INFO L226 Difference]: Without dead ends: 896 [2025-01-09 15:56:26,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:56:26,471 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 342 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:26,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 447 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:56:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-01-09 15:56:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 790. [2025-01-09 15:56:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 691 states have (on average 1.2503617945007235) internal successors, (864), 697 states have internal predecessors, (864), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:56:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1020 transitions. [2025-01-09 15:56:26,514 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1020 transitions. Word has length 139 [2025-01-09 15:56:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:26,514 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1020 transitions. [2025-01-09 15:56:26,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:56:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1020 transitions. [2025-01-09 15:56:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:26,516 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:56:26,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2008260815, now seen corresponding path program 1 times [2025-01-09 15:56:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316019056] [2025-01-09 15:56:26,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:26,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:26,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316019056] [2025-01-09 15:56:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316019056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:26,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250934677] [2025-01-09 15:56:26,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:26,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:26,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:26,638 INFO L87 Difference]: Start difference. First operand 790 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:26,842 INFO L93 Difference]: Finished difference Result 1777 states and 2297 transitions. [2025-01-09 15:56:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:26,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 15:56:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:26,847 INFO L225 Difference]: With dead ends: 1777 [2025-01-09 15:56:26,847 INFO L226 Difference]: Without dead ends: 990 [2025-01-09 15:56:26,849 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 15:56:26,849 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 52 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:26,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 356 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:56:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-01-09 15:56:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 815. [2025-01-09 15:56:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 716 states have (on average 1.2486033519553073) internal successors, (894), 722 states have internal predecessors, (894), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:56:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1050 transitions. [2025-01-09 15:56:26,891 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1050 transitions. Word has length 139 [2025-01-09 15:56:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1050 transitions. [2025-01-09 15:56:26,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1050 transitions. [2025-01-09 15:56:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:26,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:26,894 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:26,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:56:26,894 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:26,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 63712216, now seen corresponding path program 1 times [2025-01-09 15:56:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:26,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010919157] [2025-01-09 15:56:26,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:26,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:26,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010919157] [2025-01-09 15:56:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010919157] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:56:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645935012] [2025-01-09 15:56:27,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:27,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:27,210 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 15:56:27,227 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 15:56:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:27,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:27,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:27,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:56:27,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:27,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:56:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:56:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:56:27,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:56:27,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:56:27,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-01-09 15:56:27,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:27,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 12 [2025-01-09 15:56:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 216 proven. 36 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-01-09 15:56:27,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:56:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645935012] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:56:27,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:56:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2025-01-09 15:56:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488033991] [2025-01-09 15:56:27,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:56:27,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:56:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:27,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:56:27,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:56:27,767 INFO L87 Difference]: Start difference. First operand 815 states and 1050 transitions. Second operand has 14 states, 11 states have (on average 8.181818181818182) internal successors, (90), 14 states have internal predecessors, (90), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) [2025-01-09 15:56:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:28,291 INFO L93 Difference]: Finished difference Result 1679 states and 2141 transitions. [2025-01-09 15:56:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:56:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 8.181818181818182) internal successors, (90), 14 states have internal predecessors, (90), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) Word has length 139 [2025-01-09 15:56:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:28,295 INFO L225 Difference]: With dead ends: 1679 [2025-01-09 15:56:28,295 INFO L226 Difference]: Without dead ends: 867 [2025-01-09 15:56:28,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:56:28,298 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 406 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:28,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 286 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:56:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-01-09 15:56:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 847. [2025-01-09 15:56:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 740 states have (on average 1.2351351351351352) internal successors, (914), 746 states have internal predecessors, (914), 78 states have call successors, (78), 28 states have call predecessors, (78), 28 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:56:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1070 transitions. [2025-01-09 15:56:28,343 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1070 transitions. Word has length 139 [2025-01-09 15:56:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:28,344 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1070 transitions. [2025-01-09 15:56:28,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 8.181818181818182) internal successors, (90), 14 states have internal predecessors, (90), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) [2025-01-09 15:56:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1070 transitions. [2025-01-09 15:56:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:28,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:28,346 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:28,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:56:28,546 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,SelfDestructingSolverStorable15 [2025-01-09 15:56:28,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1986940250, now seen corresponding path program 1 times [2025-01-09 15:56:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:28,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579163775] [2025-01-09 15:56:28,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:28,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579163775] [2025-01-09 15:56:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579163775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:28,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:28,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494029045] [2025-01-09 15:56:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:28,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:28,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:28,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:28,914 INFO L87 Difference]: Start difference. First operand 847 states and 1070 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:29,136 INFO L93 Difference]: Finished difference Result 1727 states and 2170 transitions. [2025-01-09 15:56:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 15:56:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:29,141 INFO L225 Difference]: With dead ends: 1727 [2025-01-09 15:56:29,141 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 15:56:29,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:29,143 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 52 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:29,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 384 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 15:56:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2025-01-09 15:56:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 763 states have (on average 1.2228047182175623) internal successors, (933), 770 states have internal predecessors, (933), 82 states have call successors, (82), 34 states have call predecessors, (82), 34 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 15:56:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1097 transitions. [2025-01-09 15:56:29,191 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1097 transitions. Word has length 139 [2025-01-09 15:56:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:29,191 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1097 transitions. [2025-01-09 15:56:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1097 transitions. [2025-01-09 15:56:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:56:29,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:29,193 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:29,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:56:29,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1627968676, now seen corresponding path program 1 times [2025-01-09 15:56:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925188304] [2025-01-09 15:56:29,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:29,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:56:29,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:56:29,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925188304] [2025-01-09 15:56:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925188304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:56:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052622433] [2025-01-09 15:56:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:56:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:29,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:56:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:56:29,906 INFO L87 Difference]: Start difference. First operand 880 states and 1097 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:30,358 INFO L93 Difference]: Finished difference Result 1748 states and 2181 transitions. [2025-01-09 15:56:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:56:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 15:56:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:30,362 INFO L225 Difference]: With dead ends: 1748 [2025-01-09 15:56:30,362 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 15:56:30,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:56:30,364 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:30,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 973 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:56:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 15:56:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 874. [2025-01-09 15:56:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 757 states have (on average 1.2219286657859973) internal successors, (925), 764 states have internal predecessors, (925), 82 states have call successors, (82), 34 states have call predecessors, (82), 34 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 15:56:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1089 transitions. [2025-01-09 15:56:30,406 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1089 transitions. Word has length 139 [2025-01-09 15:56:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:30,407 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1089 transitions. [2025-01-09 15:56:30,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1089 transitions. [2025-01-09 15:56:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:56:30,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:30,408 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:30,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:56:30,408 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1538160770, now seen corresponding path program 1 times [2025-01-09 15:56:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000497253] [2025-01-09 15:56:30,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:30,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:56:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:56:30,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:30,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000497253] [2025-01-09 15:56:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000497253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318438006] [2025-01-09 15:56:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:30,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:30,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:30,929 INFO L87 Difference]: Start difference. First operand 874 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:31,238 INFO L93 Difference]: Finished difference Result 1732 states and 2151 transitions. [2025-01-09 15:56:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 15:56:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:31,242 INFO L225 Difference]: With dead ends: 1732 [2025-01-09 15:56:31,242 INFO L226 Difference]: Without dead ends: 878 [2025-01-09 15:56:31,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:31,243 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:31,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 445 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-09 15:56:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 862. [2025-01-09 15:56:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 741 states have (on average 1.2105263157894737) internal successors, (897), 748 states have internal predecessors, (897), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 15:56:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1061 transitions. [2025-01-09 15:56:31,292 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1061 transitions. Word has length 140 [2025-01-09 15:56:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:31,292 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1061 transitions. [2025-01-09 15:56:31,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1061 transitions. [2025-01-09 15:56:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:56:31,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:31,295 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:56:31,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1785395709, now seen corresponding path program 1 times [2025-01-09 15:56:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432879729] [2025-01-09 15:56:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:31,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:56:31,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:56:31,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:31,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432879729] [2025-01-09 15:56:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432879729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927509424] [2025-01-09 15:56:31,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:31,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:31,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:31,420 INFO L87 Difference]: Start difference. First operand 862 states and 1061 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:31,616 INFO L93 Difference]: Finished difference Result 1920 states and 2351 transitions. [2025-01-09 15:56:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-01-09 15:56:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:31,622 INFO L225 Difference]: With dead ends: 1920 [2025-01-09 15:56:31,622 INFO L226 Difference]: Without dead ends: 1078 [2025-01-09 15:56:31,623 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 15:56:31,625 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 74 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:31,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 343 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:56:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-01-09 15:56:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 918. [2025-01-09 15:56:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 797 states have (on average 1.2057716436637391) internal successors, (961), 804 states have internal predecessors, (961), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 15:56:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1125 transitions. [2025-01-09 15:56:31,678 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1125 transitions. Word has length 141 [2025-01-09 15:56:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:31,678 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1125 transitions. [2025-01-09 15:56:31,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1125 transitions. [2025-01-09 15:56:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:56:31,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:31,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:31,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:56:31,680 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:31,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1622288263, now seen corresponding path program 1 times [2025-01-09 15:56:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143882898] [2025-01-09 15:56:31,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:31,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:56:31,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:56:31,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143882898] [2025-01-09 15:56:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143882898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172461401] [2025-01-09 15:56:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:32,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:32,171 INFO L87 Difference]: Start difference. First operand 918 states and 1125 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:32,460 INFO L93 Difference]: Finished difference Result 1993 states and 2431 transitions. [2025-01-09 15:56:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-01-09 15:56:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:32,464 INFO L225 Difference]: With dead ends: 1993 [2025-01-09 15:56:32,464 INFO L226 Difference]: Without dead ends: 1015 [2025-01-09 15:56:32,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:32,467 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:32,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 431 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-01-09 15:56:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 855. [2025-01-09 15:56:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 734 states have (on average 1.1852861035422344) internal successors, (870), 741 states have internal predecessors, (870), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 15:56:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1034 transitions. [2025-01-09 15:56:32,516 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1034 transitions. Word has length 141 [2025-01-09 15:56:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1034 transitions. [2025-01-09 15:56:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1034 transitions. [2025-01-09 15:56:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:56:32,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:32,518 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:32,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:56:32,518 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:32,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash 662490408, now seen corresponding path program 1 times [2025-01-09 15:56:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722866399] [2025-01-09 15:56:32,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:32,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:56:32,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:56:32,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:32,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:33,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722866399] [2025-01-09 15:56:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722866399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:33,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:33,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:56:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872501914] [2025-01-09 15:56:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:33,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:56:33,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:33,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:56:33,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:33,006 INFO L87 Difference]: Start difference. First operand 855 states and 1034 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:33,381 INFO L93 Difference]: Finished difference Result 1421 states and 1690 transitions. [2025-01-09 15:56:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:56:33,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-01-09 15:56:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:33,386 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 15:56:33,386 INFO L226 Difference]: Without dead ends: 1419 [2025-01-09 15:56:33,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:33,388 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 67 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:33,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 897 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-01-09 15:56:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1415. [2025-01-09 15:56:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1186 states have (on average 1.1551433389544687) internal successors, (1370), 1201 states have internal predecessors, (1370), 154 states have call successors, (154), 74 states have call predecessors, (154), 74 states have return successors, (154), 139 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 15:56:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1678 transitions. [2025-01-09 15:56:33,474 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1678 transitions. Word has length 141 [2025-01-09 15:56:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:33,475 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1678 transitions. [2025-01-09 15:56:33,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1678 transitions. [2025-01-09 15:56:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:56:33,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:33,476 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:33,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:56:33,477 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:33,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1558198843, now seen corresponding path program 1 times [2025-01-09 15:56:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:33,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086507492] [2025-01-09 15:56:33,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:33,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:56:33,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:56:33,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:33,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:33,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086507492] [2025-01-09 15:56:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086507492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:33,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462218887] [2025-01-09 15:56:33,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:33,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:33,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:33,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:33,941 INFO L87 Difference]: Start difference. First operand 1415 states and 1678 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:34,303 INFO L93 Difference]: Finished difference Result 2776 states and 3281 transitions. [2025-01-09 15:56:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-01-09 15:56:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:34,308 INFO L225 Difference]: With dead ends: 2776 [2025-01-09 15:56:34,308 INFO L226 Difference]: Without dead ends: 1381 [2025-01-09 15:56:34,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:34,310 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 51 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:34,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 357 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-01-09 15:56:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1371. [2025-01-09 15:56:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1142 states have (on average 1.1357267950963224) internal successors, (1297), 1157 states have internal predecessors, (1297), 154 states have call successors, (154), 74 states have call predecessors, (154), 74 states have return successors, (154), 139 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 15:56:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1605 transitions. [2025-01-09 15:56:34,395 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1605 transitions. Word has length 142 [2025-01-09 15:56:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:34,396 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1605 transitions. [2025-01-09 15:56:34,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:56:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1605 transitions. [2025-01-09 15:56:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:56:34,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:34,397 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:34,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:56:34,398 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:34,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1831812949, now seen corresponding path program 1 times [2025-01-09 15:56:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774860936] [2025-01-09 15:56:34,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:56:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:56:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774860936] [2025-01-09 15:56:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774860936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:34,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312957013] [2025-01-09 15:56:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:34,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:34,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:34,740 INFO L87 Difference]: Start difference. First operand 1371 states and 1605 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:35,083 INFO L93 Difference]: Finished difference Result 2413 states and 2829 transitions. [2025-01-09 15:56:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-01-09 15:56:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:35,089 INFO L225 Difference]: With dead ends: 2413 [2025-01-09 15:56:35,089 INFO L226 Difference]: Without dead ends: 1062 [2025-01-09 15:56:35,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:35,091 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 72 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:35,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 396 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:56:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-01-09 15:56:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1022. [2025-01-09 15:56:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 849 states have (on average 1.1260306242638398) internal successors, (956), 859 states have internal predecessors, (956), 118 states have call successors, (118), 54 states have call predecessors, (118), 54 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 15:56:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1192 transitions. [2025-01-09 15:56:35,181 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1192 transitions. Word has length 142 [2025-01-09 15:56:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:35,181 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1192 transitions. [2025-01-09 15:56:35,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1192 transitions. [2025-01-09 15:56:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:56:35,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:35,184 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:35,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:56:35,184 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:35,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 318547737, now seen corresponding path program 1 times [2025-01-09 15:56:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654567126] [2025-01-09 15:56:35,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:35,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:56:35,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:56:35,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:35,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654567126] [2025-01-09 15:56:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654567126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:35,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484880221] [2025-01-09 15:56:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:35,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:35,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:35,463 INFO L87 Difference]: Start difference. First operand 1022 states and 1192 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:35,752 INFO L93 Difference]: Finished difference Result 2024 states and 2355 transitions. [2025-01-09 15:56:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-01-09 15:56:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:35,762 INFO L225 Difference]: With dead ends: 2024 [2025-01-09 15:56:35,762 INFO L226 Difference]: Without dead ends: 1005 [2025-01-09 15:56:35,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:35,764 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 72 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:35,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 416 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-01-09 15:56:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 961. [2025-01-09 15:56:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 788 states have (on average 1.118020304568528) internal successors, (881), 798 states have internal predecessors, (881), 118 states have call successors, (118), 54 states have call predecessors, (118), 54 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 15:56:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1117 transitions. [2025-01-09 15:56:35,838 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1117 transitions. Word has length 143 [2025-01-09 15:56:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1117 transitions. [2025-01-09 15:56:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1117 transitions. [2025-01-09 15:56:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:35,840 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:56:35,840 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 509179461, now seen corresponding path program 1 times [2025-01-09 15:56:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701496372] [2025-01-09 15:56:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:35,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:35,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:35,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701496372] [2025-01-09 15:56:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701496372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984240952] [2025-01-09 15:56:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:36,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:36,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:36,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:36,718 INFO L87 Difference]: Start difference. First operand 961 states and 1117 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:37,013 INFO L93 Difference]: Finished difference Result 2433 states and 2812 transitions. [2025-01-09 15:56:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-01-09 15:56:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:37,018 INFO L225 Difference]: With dead ends: 2433 [2025-01-09 15:56:37,018 INFO L226 Difference]: Without dead ends: 1475 [2025-01-09 15:56:37,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:37,020 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 32 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:37,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 398 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:56:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-01-09 15:56:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1237. [2025-01-09 15:56:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1064 states have (on average 1.106203007518797) internal successors, (1177), 1074 states have internal predecessors, (1177), 118 states have call successors, (118), 54 states have call predecessors, (118), 54 states have return successors, (118), 108 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 15:56:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1413 transitions. [2025-01-09 15:56:37,107 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1413 transitions. Word has length 144 [2025-01-09 15:56:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1413 transitions. [2025-01-09 15:56:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:56:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1413 transitions. [2025-01-09 15:56:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:37,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:37,108 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:37,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:56:37,109 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:37,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -300167165, now seen corresponding path program 1 times [2025-01-09 15:56:37,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:37,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112533457] [2025-01-09 15:56:37,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:37,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:37,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:37,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:37,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:37,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:56:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:38,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112533457] [2025-01-09 15:56:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112533457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:38,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:56:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390199303] [2025-01-09 15:56:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:38,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:56:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:38,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:56:38,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:38,185 INFO L87 Difference]: Start difference. First operand 1237 states and 1413 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:56:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:38,742 INFO L93 Difference]: Finished difference Result 1595 states and 1807 transitions. [2025-01-09 15:56:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:56:38,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-01-09 15:56:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:38,746 INFO L225 Difference]: With dead ends: 1595 [2025-01-09 15:56:38,746 INFO L226 Difference]: Without dead ends: 1593 [2025-01-09 15:56:38,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:56:38,747 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 59 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:38,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1081 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:56:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-01-09 15:56:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1589. [2025-01-09 15:56:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1362 states have (on average 1.0947136563876652) internal successors, (1491), 1376 states have internal predecessors, (1491), 154 states have call successors, (154), 72 states have call predecessors, (154), 72 states have return successors, (154), 140 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 15:56:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1799 transitions. [2025-01-09 15:56:38,847 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1799 transitions. Word has length 144 [2025-01-09 15:56:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:38,848 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1799 transitions. [2025-01-09 15:56:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:56:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1799 transitions. [2025-01-09 15:56:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:38,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:38,849 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:56:38,850 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1474840197, now seen corresponding path program 1 times [2025-01-09 15:56:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098331027] [2025-01-09 15:56:38,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:38,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:38,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:38,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat