./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:20:57,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:20:57,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:20:57,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:20:57,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:20:57,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:20:57,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:20:57,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:20:57,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:20:57,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:20:57,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:20:57,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:20:57,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:20:57,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:20:57,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:20:57,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:20:57,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:20:57,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:20:57,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:20:57,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:20:57,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:20:57,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:20:57,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:20:57,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:20:57,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:20:57,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:20:57,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:20:57,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:20:57,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:20:57,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:20:57,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:20:57,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:20:57,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:20:57,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:20:57,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:20:57,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:20:57,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:20:57,478 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab [2024-11-10 09:20:57,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:20:57,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:20:57,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:20:57,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:20:57,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:20:57,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2024-11-10 09:20:59,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:20:59,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:20:59,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2024-11-10 09:20:59,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078810884/1bafb210bbfd45b6a63658d10c82ac19/FLAGbeeb224d9 [2024-11-10 09:20:59,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078810884/1bafb210bbfd45b6a63658d10c82ac19 [2024-11-10 09:20:59,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:20:59,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:20:59,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:20:59,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:20:59,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:20:59,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd18049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59, skipping insertion in model container [2024-11-10 09:20:59,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:20:59,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2024-11-10 09:20:59,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:20:59,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:20:59,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2024-11-10 09:20:59,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:20:59,467 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:20:59,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59 WrapperNode [2024-11-10 09:20:59,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:20:59,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:20:59,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:20:59,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:20:59,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,548 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2024-11-10 09:20:59,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:20:59,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:20:59,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:20:59,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:20:59,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,583 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 44, 29, 5, 13, 14]. 41 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 5, 3, 1, 1, 2]. The 15 writes are split as follows [0, 8, 3, 1, 1, 2]. [2024-11-10 09:20:59,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:20:59,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:20:59,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:20:59,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:20:59,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (1/1) ... [2024-11-10 09:20:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:20:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:20:59,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:20:59,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:20:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:20:59,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:20:59,854 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:20:59,856 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:00,214 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem64#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~short63#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite100#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite99#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite98#1;havoc property_#t~mem88#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1; [2024-11-10 09:21:00,245 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:00,245 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:00,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:00,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:00,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:00 BoogieIcfgContainer [2024-11-10 09:21:00,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:00,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:00,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:00,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:00,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:20:59" (1/3) ... [2024-11-10 09:21:00,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8131f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:00, skipping insertion in model container [2024-11-10 09:21:00,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:59" (2/3) ... [2024-11-10 09:21:00,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8131f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:00, skipping insertion in model container [2024-11-10 09:21:00,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:00" (3/3) ... [2024-11-10 09:21:00,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-89.i [2024-11-10 09:21:00,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:00,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:00,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:00,355 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;@30c0339c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:00,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:21:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:00,371 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:00,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:00,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1939919480, now seen corresponding path program 1 times [2024-11-10 09:21:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521637367] [2024-11-10 09:21:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521637367] [2024-11-10 09:21:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521637367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173370023] [2024-11-10 09:21:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:00,781 INFO L87 Difference]: Start difference. First operand has 105 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:00,813 INFO L93 Difference]: Finished difference Result 202 states and 312 transitions. [2024-11-10 09:21:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:00,825 INFO L225 Difference]: With dead ends: 202 [2024-11-10 09:21:00,825 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 09:21:00,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:00,833 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 09:21:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 09:21:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:21:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-10 09:21:00,880 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 111 [2024-11-10 09:21:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:00,881 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-10 09:21:00,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-10 09:21:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:00,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:00,884 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:00,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:21:00,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:00,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash -963771, now seen corresponding path program 1 times [2024-11-10 09:21:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337626980] [2024-11-10 09:21:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337626980] [2024-11-10 09:21:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337626980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:01,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462650530] [2024-11-10 09:21:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:01,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:01,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:01,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:01,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:01,183 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:01,235 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2024-11-10 09:21:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:01,237 INFO L225 Difference]: With dead ends: 200 [2024-11-10 09:21:01,237 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 09:21:01,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:01,239 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:01,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 09:21:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 09:21:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:21:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-10 09:21:01,252 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 111 [2024-11-10 09:21:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:01,254 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-10 09:21:01,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-10 09:21:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:01,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:01,255 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:01,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:21:01,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -197477276, now seen corresponding path program 1 times [2024-11-10 09:21:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043145284] [2024-11-10 09:21:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043145284] [2024-11-10 09:21:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043145284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429136374] [2024-11-10 09:21:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:01,504 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:01,585 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-11-10 09:21:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:01,592 INFO L225 Difference]: With dead ends: 204 [2024-11-10 09:21:01,592 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 09:21:01,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:01,596 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:01,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 529 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 09:21:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-10 09:21:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:21:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-10 09:21:01,607 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 111 [2024-11-10 09:21:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:01,609 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-10 09:21:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-10 09:21:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:01,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:01,611 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:01,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:21:01,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1545333059, now seen corresponding path program 1 times [2024-11-10 09:21:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308310808] [2024-11-10 09:21:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308310808] [2024-11-10 09:21:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308310808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771563945] [2024-11-10 09:21:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:01,811 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:01,851 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2024-11-10 09:21:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:01,853 INFO L225 Difference]: With dead ends: 208 [2024-11-10 09:21:01,853 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 09:21:01,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:01,854 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:01,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 09:21:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-10 09:21:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:21:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2024-11-10 09:21:01,870 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 111 [2024-11-10 09:21:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:01,871 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2024-11-10 09:21:01,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2024-11-10 09:21:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:01,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:01,872 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:21:01,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:01,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1573962210, now seen corresponding path program 1 times [2024-11-10 09:21:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839463265] [2024-11-10 09:21:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839463265] [2024-11-10 09:21:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839463265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:03,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:03,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:21:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945150780] [2024-11-10 09:21:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:03,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:21:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:21:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:03,449 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:03,836 INFO L93 Difference]: Finished difference Result 284 states and 398 transitions. [2024-11-10 09:21:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:21:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:03,838 INFO L225 Difference]: With dead ends: 284 [2024-11-10 09:21:03,838 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 09:21:03,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:03,839 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 89 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:03,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 933 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:03,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 09:21:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-10 09:21:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 159 states have (on average 1.371069182389937) internal successors, (218), 160 states have internal predecessors, (218), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:21:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2024-11-10 09:21:03,859 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 111 [2024-11-10 09:21:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:03,859 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2024-11-10 09:21:03,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2024-11-10 09:21:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:03,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:03,860 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:03,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:21:03,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:03,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1367695389, now seen corresponding path program 1 times [2024-11-10 09:21:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106225306] [2024-11-10 09:21:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:04,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106225306] [2024-11-10 09:21:04,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106225306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:04,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:04,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305151790] [2024-11-10 09:21:04,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:04,304 INFO L87 Difference]: Start difference. First operand 177 states and 248 transitions. Second operand has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-10 09:21:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:04,494 INFO L93 Difference]: Finished difference Result 362 states and 504 transitions. [2024-11-10 09:21:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-10 09:21:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:04,496 INFO L225 Difference]: With dead ends: 362 [2024-11-10 09:21:04,497 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 09:21:04,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:04,499 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:04,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 690 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 09:21:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-11-10 09:21:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 164 states have internal predecessors, (221), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 255 transitions. [2024-11-10 09:21:04,522 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 255 transitions. Word has length 111 [2024-11-10 09:21:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:04,522 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 255 transitions. [2024-11-10 09:21:04,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-10 09:21:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 255 transitions. [2024-11-10 09:21:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:04,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:04,523 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:04,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:21:04,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 956774878, now seen corresponding path program 1 times [2024-11-10 09:21:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981292418] [2024-11-10 09:21:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981292418] [2024-11-10 09:21:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981292418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559868252] [2024-11-10 09:21:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:05,351 INFO L87 Difference]: Start difference. First operand 184 states and 255 transitions. 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:05,734 INFO L93 Difference]: Finished difference Result 627 states and 872 transitions. [2024-11-10 09:21:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:05,735 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:05,738 INFO L225 Difference]: With dead ends: 627 [2024-11-10 09:21:05,738 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 09:21:05,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:05,739 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 273 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:05,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 726 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:21:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 09:21:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2024-11-10 09:21:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 385 states have (on average 1.3558441558441559) internal successors, (522), 388 states have internal predecessors, (522), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 09:21:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 610 transitions. [2024-11-10 09:21:05,765 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 610 transitions. Word has length 111 [2024-11-10 09:21:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 610 transitions. [2024-11-10 09:21:05,765 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 610 transitions. [2024-11-10 09:21:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:05,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:05,767 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:05,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:21:05,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:05,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1476240605, now seen corresponding path program 1 times [2024-11-10 09:21:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429522915] [2024-11-10 09:21:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429522915] [2024-11-10 09:21:06,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429522915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:06,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:06,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317747302] [2024-11-10 09:21:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:06,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:06,212 INFO L87 Difference]: Start difference. First operand 437 states and 610 transitions. Second operand has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-10 09:21:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:06,398 INFO L93 Difference]: Finished difference Result 968 states and 1345 transitions. [2024-11-10 09:21:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:21:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-10 09:21:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:06,402 INFO L225 Difference]: With dead ends: 968 [2024-11-10 09:21:06,402 INFO L226 Difference]: Without dead ends: 534 [2024-11-10 09:21:06,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:06,404 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 173 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:06,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 614 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-10 09:21:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 526. [2024-11-10 09:21:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 463 states have (on average 1.349892008639309) internal successors, (625), 468 states have internal predecessors, (625), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 09:21:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 729 transitions. [2024-11-10 09:21:06,432 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 729 transitions. Word has length 111 [2024-11-10 09:21:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 729 transitions. [2024-11-10 09:21:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-10 09:21:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 729 transitions. [2024-11-10 09:21:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:06,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:06,434 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:21:06,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:06,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -122930908, now seen corresponding path program 1 times [2024-11-10 09:21:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929964614] [2024-11-10 09:21:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929964614] [2024-11-10 09:21:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929964614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:21:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843508070] [2024-11-10 09:21:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:06,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:21:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:21:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:06,788 INFO L87 Difference]: Start difference. First operand 526 states and 729 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:07,037 INFO L93 Difference]: Finished difference Result 1122 states and 1555 transitions. [2024-11-10 09:21:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:21:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:07,041 INFO L225 Difference]: With dead ends: 1122 [2024-11-10 09:21:07,041 INFO L226 Difference]: Without dead ends: 613 [2024-11-10 09:21:07,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:07,045 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 132 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:07,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 997 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-10 09:21:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 588. [2024-11-10 09:21:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 498 states have (on average 1.323293172690763) internal successors, (659), 503 states have internal predecessors, (659), 76 states have call successors, (76), 13 states have call predecessors, (76), 13 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-10 09:21:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 811 transitions. [2024-11-10 09:21:07,085 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 811 transitions. Word has length 111 [2024-11-10 09:21:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 811 transitions. [2024-11-10 09:21:07,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 811 transitions. [2024-11-10 09:21:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:07,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:07,088 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:21:07,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1867232034, now seen corresponding path program 1 times [2024-11-10 09:21:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829001641] [2024-11-10 09:21:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829001641] [2024-11-10 09:21:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829001641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:07,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:07,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116982138] [2024-11-10 09:21:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:07,695 INFO L87 Difference]: Start difference. First operand 588 states and 811 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:08,139 INFO L93 Difference]: Finished difference Result 1158 states and 1592 transitions. [2024-11-10 09:21:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:08,143 INFO L225 Difference]: With dead ends: 1158 [2024-11-10 09:21:08,143 INFO L226 Difference]: Without dead ends: 599 [2024-11-10 09:21:08,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:08,145 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 240 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:08,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 740 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:21:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-10 09:21:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2024-11-10 09:21:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 499 states have (on average 1.3186372745490982) internal successors, (658), 504 states have internal predecessors, (658), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-10 09:21:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 810 transitions. [2024-11-10 09:21:08,181 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 810 transitions. Word has length 111 [2024-11-10 09:21:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:08,181 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 810 transitions. [2024-11-10 09:21:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 810 transitions. [2024-11-10 09:21:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:08,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:08,183 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:08,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:21:08,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1810547930, now seen corresponding path program 1 times [2024-11-10 09:21:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674751964] [2024-11-10 09:21:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674751964] [2024-11-10 09:21:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674751964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:21:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494548281] [2024-11-10 09:21:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:08,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:21:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:21:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:08,976 INFO L87 Difference]: Start difference. First operand 590 states and 810 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:09,313 INFO L93 Difference]: Finished difference Result 1280 states and 1764 transitions. [2024-11-10 09:21:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:21:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:09,316 INFO L225 Difference]: With dead ends: 1280 [2024-11-10 09:21:09,316 INFO L226 Difference]: Without dead ends: 719 [2024-11-10 09:21:09,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:09,318 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 83 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:09,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1063 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-10 09:21:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 628. [2024-11-10 09:21:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 537 states have (on average 1.3314711359404097) internal successors, (715), 542 states have internal predecessors, (715), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-10 09:21:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 867 transitions. [2024-11-10 09:21:09,354 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 867 transitions. Word has length 111 [2024-11-10 09:21:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:09,354 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 867 transitions. [2024-11-10 09:21:09,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 867 transitions. [2024-11-10 09:21:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:09,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:09,356 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:09,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:21:09,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:09,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1131109669, now seen corresponding path program 1 times [2024-11-10 09:21:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:09,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816997542] [2024-11-10 09:21:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816997542] [2024-11-10 09:21:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816997542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:09,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384900067] [2024-11-10 09:21:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:09,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:09,647 INFO L87 Difference]: Start difference. First operand 628 states and 867 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:09,830 INFO L93 Difference]: Finished difference Result 1338 states and 1844 transitions. [2024-11-10 09:21:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:09,833 INFO L225 Difference]: With dead ends: 1338 [2024-11-10 09:21:09,833 INFO L226 Difference]: Without dead ends: 739 [2024-11-10 09:21:09,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:09,835 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 169 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:09,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 683 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-10 09:21:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 734. [2024-11-10 09:21:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 633 states have (on average 1.3285939968404423) internal successors, (841), 640 states have internal predecessors, (841), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:21:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1009 transitions. [2024-11-10 09:21:09,868 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1009 transitions. Word has length 111 [2024-11-10 09:21:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:09,869 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1009 transitions. [2024-11-10 09:21:09,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1009 transitions. [2024-11-10 09:21:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:09,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:09,870 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:21:09,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1239654885, now seen corresponding path program 1 times [2024-11-10 09:21:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246132447] [2024-11-10 09:21:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246132447] [2024-11-10 09:21:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246132447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:10,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769957617] [2024-11-10 09:21:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:10,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:10,153 INFO L87 Difference]: Start difference. First operand 734 states and 1009 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:10,325 INFO L93 Difference]: Finished difference Result 1454 states and 1992 transitions. [2024-11-10 09:21:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-10 09:21:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:10,329 INFO L225 Difference]: With dead ends: 1454 [2024-11-10 09:21:10,329 INFO L226 Difference]: Without dead ends: 749 [2024-11-10 09:21:10,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:10,332 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 91 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:10,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 622 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-10 09:21:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 542. [2024-11-10 09:21:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 471 states have (on average 1.335456475583864) internal successors, (629), 475 states have internal predecessors, (629), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-10 09:21:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 743 transitions. [2024-11-10 09:21:10,359 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 743 transitions. Word has length 111 [2024-11-10 09:21:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:10,359 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 743 transitions. [2024-11-10 09:21:10,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 09:21:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 743 transitions. [2024-11-10 09:21:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:21:10,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:10,361 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:21:10,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 113654812, now seen corresponding path program 1 times [2024-11-10 09:21:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575967091] [2024-11-10 09:21:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575967091] [2024-11-10 09:21:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575967091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:21:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868049445] [2024-11-10 09:21:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:21:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:21:10,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:10,733 INFO L87 Difference]: Start difference. First operand 542 states and 743 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:11,000 INFO L93 Difference]: Finished difference Result 1249 states and 1706 transitions. [2024-11-10 09:21:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:21:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-10 09:21:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:11,004 INFO L225 Difference]: With dead ends: 1249 [2024-11-10 09:21:11,005 INFO L226 Difference]: Without dead ends: 736 [2024-11-10 09:21:11,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:11,007 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 132 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:11,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1173 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-10 09:21:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 470. [2024-11-10 09:21:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 411 states have (on average 1.3454987834549879) internal successors, (553), 414 states have internal predecessors, (553), 47 states have call successors, (47), 11 states have call predecessors, (47), 11 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 647 transitions. [2024-11-10 09:21:11,032 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 647 transitions. Word has length 111 [2024-11-10 09:21:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 647 transitions. [2024-11-10 09:21:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 647 transitions. [2024-11-10 09:21:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:21:11,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:11,033 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:11,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:21:11,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,034 INFO L85 PathProgramCache]: Analyzing trace with hash -205842976, now seen corresponding path program 1 times [2024-11-10 09:21:11,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:11,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382672921] [2024-11-10 09:21:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382672921] [2024-11-10 09:21:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382672921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758988329] [2024-11-10 09:21:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:11,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:11,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:11,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:11,203 INFO L87 Difference]: Start difference. First operand 470 states and 647 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:11,337 INFO L93 Difference]: Finished difference Result 1056 states and 1462 transitions. [2024-11-10 09:21:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-10 09:21:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:11,340 INFO L225 Difference]: With dead ends: 1056 [2024-11-10 09:21:11,341 INFO L226 Difference]: Without dead ends: 625 [2024-11-10 09:21:11,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:11,343 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 113 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:11,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 503 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-10 09:21:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 550. [2024-11-10 09:21:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 491 states have (on average 1.3604887983706722) internal successors, (668), 493 states have internal predecessors, (668), 47 states have call successors, (47), 11 states have call predecessors, (47), 11 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 762 transitions. [2024-11-10 09:21:11,369 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 762 transitions. Word has length 113 [2024-11-10 09:21:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:11,370 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 762 transitions. [2024-11-10 09:21:11,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 762 transitions. [2024-11-10 09:21:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:21:11,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:11,371 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:21:11,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1328994440, now seen corresponding path program 1 times [2024-11-10 09:21:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:11,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539195879] [2024-11-10 09:21:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539195879] [2024-11-10 09:21:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539195879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344780699] [2024-11-10 09:21:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:11,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:11,493 INFO L87 Difference]: Start difference. First operand 550 states and 762 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:11,529 INFO L93 Difference]: Finished difference Result 993 states and 1375 transitions. [2024-11-10 09:21:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-10 09:21:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:11,532 INFO L225 Difference]: With dead ends: 993 [2024-11-10 09:21:11,532 INFO L226 Difference]: Without dead ends: 562 [2024-11-10 09:21:11,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:11,533 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:11,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-10 09:21:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2024-11-10 09:21:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.3518886679920477) internal successors, (680), 505 states have internal predecessors, (680), 47 states have call successors, (47), 11 states have call predecessors, (47), 11 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 774 transitions. [2024-11-10 09:21:11,553 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 774 transitions. Word has length 113 [2024-11-10 09:21:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:11,554 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 774 transitions. [2024-11-10 09:21:11,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 774 transitions. [2024-11-10 09:21:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:21:11,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:11,555 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:21:11,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1361933468, now seen corresponding path program 1 times [2024-11-10 09:21:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:11,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158654777] [2024-11-10 09:21:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:11,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:11,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158654777] [2024-11-10 09:21:11,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158654777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:11,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:11,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:11,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107058729] [2024-11-10 09:21:11,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:11,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:11,866 INFO L87 Difference]: Start difference. First operand 562 states and 774 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:11,956 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2024-11-10 09:21:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:11,957 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 115 [2024-11-10 09:21:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:11,959 INFO L225 Difference]: With dead ends: 581 [2024-11-10 09:21:11,959 INFO L226 Difference]: Without dead ends: 578 [2024-11-10 09:21:11,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:11,959 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 99 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:11,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 709 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-10 09:21:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2024-11-10 09:21:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 518 states have (on average 1.3416988416988418) internal successors, (695), 520 states have internal predecessors, (695), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 789 transitions. [2024-11-10 09:21:11,981 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 789 transitions. Word has length 115 [2024-11-10 09:21:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:11,981 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 789 transitions. [2024-11-10 09:21:11,981 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 789 transitions. [2024-11-10 09:21:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:21:11,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:11,982 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:11,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:21:11,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1333304317, now seen corresponding path program 1 times [2024-11-10 09:21:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870502806] [2024-11-10 09:21:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870502806] [2024-11-10 09:21:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870502806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210096325] [2024-11-10 09:21:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:12,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:12,399 INFO L87 Difference]: Start difference. First operand 578 states and 789 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:12,650 INFO L93 Difference]: Finished difference Result 1042 states and 1418 transitions. [2024-11-10 09:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 115 [2024-11-10 09:21:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:12,653 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 09:21:12,653 INFO L226 Difference]: Without dead ends: 583 [2024-11-10 09:21:12,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:12,654 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 132 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:12,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 782 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-10 09:21:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2024-11-10 09:21:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 518 states have (on average 1.337837837837838) internal successors, (693), 520 states have internal predecessors, (693), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 787 transitions. [2024-11-10 09:21:12,675 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 787 transitions. Word has length 115 [2024-11-10 09:21:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 787 transitions. [2024-11-10 09:21:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 787 transitions. [2024-11-10 09:21:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:21:12,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:12,677 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:12,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:21:12,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:12,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash 409506018, now seen corresponding path program 1 times [2024-11-10 09:21:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070932137] [2024-11-10 09:21:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:12,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070932137] [2024-11-10 09:21:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070932137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596331668] [2024-11-10 09:21:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:12,821 INFO L87 Difference]: Start difference. First operand 578 states and 787 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:12,896 INFO L93 Difference]: Finished difference Result 1045 states and 1415 transitions. [2024-11-10 09:21:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 115 [2024-11-10 09:21:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:12,899 INFO L225 Difference]: With dead ends: 1045 [2024-11-10 09:21:12,899 INFO L226 Difference]: Without dead ends: 586 [2024-11-10 09:21:12,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:12,900 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 94 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:12,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 514 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-10 09:21:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2024-11-10 09:21:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 524 states have (on average 1.3263358778625953) internal successors, (695), 526 states have internal predecessors, (695), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 789 transitions. [2024-11-10 09:21:12,923 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 789 transitions. Word has length 115 [2024-11-10 09:21:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:12,923 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 789 transitions. [2024-11-10 09:21:12,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 789 transitions. [2024-11-10 09:21:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:21:12,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:12,924 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:21:12,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 212992513, now seen corresponding path program 1 times [2024-11-10 09:21:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933357295] [2024-11-10 09:21:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933357295] [2024-11-10 09:21:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933357295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:13,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701526300] [2024-11-10 09:21:13,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:13,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:13,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,037 INFO L87 Difference]: Start difference. First operand 586 states and 789 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:13,072 INFO L93 Difference]: Finished difference Result 1065 states and 1429 transitions. [2024-11-10 09:21:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 115 [2024-11-10 09:21:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:13,075 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 09:21:13,075 INFO L226 Difference]: Without dead ends: 598 [2024-11-10 09:21:13,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,077 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:13,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-10 09:21:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-11-10 09:21:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 536 states have (on average 1.3190298507462686) internal successors, (707), 538 states have internal predecessors, (707), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 801 transitions. [2024-11-10 09:21:13,099 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 801 transitions. Word has length 115 [2024-11-10 09:21:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:13,099 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 801 transitions. [2024-11-10 09:21:13,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 801 transitions. [2024-11-10 09:21:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 09:21:13,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:13,100 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:21:13,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:13,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 151895178, now seen corresponding path program 1 times [2024-11-10 09:21:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036451228] [2024-11-10 09:21:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036451228] [2024-11-10 09:21:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036451228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284875463] [2024-11-10 09:21:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:13,219 INFO L87 Difference]: Start difference. First operand 598 states and 801 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:13,264 INFO L93 Difference]: Finished difference Result 1093 states and 1457 transitions. [2024-11-10 09:21:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2024-11-10 09:21:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:13,267 INFO L225 Difference]: With dead ends: 1093 [2024-11-10 09:21:13,267 INFO L226 Difference]: Without dead ends: 614 [2024-11-10 09:21:13,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:13,268 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:13,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-10 09:21:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 602. [2024-11-10 09:21:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.3166666666666667) internal successors, (711), 542 states have internal predecessors, (711), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 805 transitions. [2024-11-10 09:21:13,294 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 805 transitions. Word has length 118 [2024-11-10 09:21:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:13,294 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 805 transitions. [2024-11-10 09:21:13,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 805 transitions. [2024-11-10 09:21:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 09:21:13,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:13,295 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:21:13,296 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:13,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -97262277, now seen corresponding path program 1 times [2024-11-10 09:21:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691155172] [2024-11-10 09:21:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691155172] [2024-11-10 09:21:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691155172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381560369] [2024-11-10 09:21:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,514 INFO L87 Difference]: Start difference. First operand 602 states and 805 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:13,645 INFO L93 Difference]: Finished difference Result 1090 states and 1450 transitions. [2024-11-10 09:21:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:13,645 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 120 [2024-11-10 09:21:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:13,648 INFO L225 Difference]: With dead ends: 1090 [2024-11-10 09:21:13,648 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:21:13,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:13,650 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 88 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:13,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 442 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:21:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 602. [2024-11-10 09:21:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.3129629629629629) internal successors, (709), 542 states have internal predecessors, (709), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 803 transitions. [2024-11-10 09:21:13,672 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 803 transitions. Word has length 120 [2024-11-10 09:21:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:13,673 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 803 transitions. [2024-11-10 09:21:13,673 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 803 transitions. [2024-11-10 09:21:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:21:13,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:13,674 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:13,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:21:13,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -126854221, now seen corresponding path program 1 times [2024-11-10 09:21:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46329166] [2024-11-10 09:21:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46329166] [2024-11-10 09:21:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46329166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508831461] [2024-11-10 09:21:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:13,896 INFO L87 Difference]: Start difference. First operand 602 states and 803 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:14,046 INFO L93 Difference]: Finished difference Result 1090 states and 1446 transitions. [2024-11-10 09:21:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2024-11-10 09:21:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:14,049 INFO L225 Difference]: With dead ends: 1090 [2024-11-10 09:21:14,049 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:21:14,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:14,050 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 108 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:14,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 550 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:21:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 602. [2024-11-10 09:21:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.3092592592592593) internal successors, (707), 542 states have internal predecessors, (707), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 801 transitions. [2024-11-10 09:21:14,078 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 801 transitions. Word has length 124 [2024-11-10 09:21:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 801 transitions. [2024-11-10 09:21:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 801 transitions. [2024-11-10 09:21:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:21:14,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:14,081 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:14,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:21:14,081 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1318244951, now seen corresponding path program 1 times [2024-11-10 09:21:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070516400] [2024-11-10 09:21:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070516400] [2024-11-10 09:21:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070516400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359202216] [2024-11-10 09:21:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:14,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:14,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:14,335 INFO L87 Difference]: Start difference. First operand 602 states and 801 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:14,503 INFO L93 Difference]: Finished difference Result 1090 states and 1442 transitions. [2024-11-10 09:21:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:14,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 125 [2024-11-10 09:21:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:14,506 INFO L225 Difference]: With dead ends: 1090 [2024-11-10 09:21:14,506 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:21:14,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:14,508 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:14,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 556 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:21:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 602. [2024-11-10 09:21:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.3055555555555556) internal successors, (705), 542 states have internal predecessors, (705), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 799 transitions. [2024-11-10 09:21:14,544 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 799 transitions. Word has length 125 [2024-11-10 09:21:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 799 transitions. [2024-11-10 09:21:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 799 transitions. [2024-11-10 09:21:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:21:14,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:14,546 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:14,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:21:14,547 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:14,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1120960900, now seen corresponding path program 1 times [2024-11-10 09:21:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299773200] [2024-11-10 09:21:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:14,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299773200] [2024-11-10 09:21:14,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299773200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:14,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:14,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773213812] [2024-11-10 09:21:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:14,810 INFO L87 Difference]: Start difference. First operand 602 states and 799 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:14,968 INFO L93 Difference]: Finished difference Result 1090 states and 1438 transitions. [2024-11-10 09:21:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2024-11-10 09:21:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:14,972 INFO L225 Difference]: With dead ends: 1090 [2024-11-10 09:21:14,972 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:21:14,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:14,973 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 84 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:14,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 540 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:21:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 602. [2024-11-10 09:21:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.3018518518518518) internal successors, (703), 542 states have internal predecessors, (703), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 09:21:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 797 transitions. [2024-11-10 09:21:14,995 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 797 transitions. Word has length 126 [2024-11-10 09:21:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:14,996 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 797 transitions. [2024-11-10 09:21:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 797 transitions. [2024-11-10 09:21:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:21:14,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:14,997 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:14,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:21:14,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:14,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1939755737, now seen corresponding path program 1 times [2024-11-10 09:21:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916671642] [2024-11-10 09:21:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916671642] [2024-11-10 09:21:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916671642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:21:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877890620] [2024-11-10 09:21:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:21:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:15,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:21:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:15,530 INFO L87 Difference]: Start difference. First operand 602 states and 797 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:16,091 INFO L93 Difference]: Finished difference Result 1682 states and 2184 transitions. [2024-11-10 09:21:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 09:21:16,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2024-11-10 09:21:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:16,096 INFO L225 Difference]: With dead ends: 1682 [2024-11-10 09:21:16,096 INFO L226 Difference]: Without dead ends: 1199 [2024-11-10 09:21:16,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:21:16,098 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 111 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:16,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1327 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:21:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-10 09:21:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1035. [2024-11-10 09:21:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 927 states have (on average 1.2686084142394822) internal successors, (1176), 931 states have internal predecessors, (1176), 81 states have call successors, (81), 26 states have call predecessors, (81), 26 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-10 09:21:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1338 transitions. [2024-11-10 09:21:16,145 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1338 transitions. Word has length 128 [2024-11-10 09:21:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:16,146 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1338 transitions. [2024-11-10 09:21:16,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1338 transitions. [2024-11-10 09:21:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:21:16,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:16,147 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:16,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:21:16,148 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -578208444, now seen corresponding path program 1 times [2024-11-10 09:21:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253614511] [2024-11-10 09:21:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253614511] [2024-11-10 09:21:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253614511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877073236] [2024-11-10 09:21:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:16,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:16,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:16,329 INFO L87 Difference]: Start difference. First operand 1035 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:16,422 INFO L93 Difference]: Finished difference Result 1546 states and 1999 transitions. [2024-11-10 09:21:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:16,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 131 [2024-11-10 09:21:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:16,427 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 09:21:16,427 INFO L226 Difference]: Without dead ends: 1042 [2024-11-10 09:21:16,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:16,429 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 95 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:16,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 359 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-10 09:21:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1035. [2024-11-10 09:21:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 927 states have (on average 1.2599784250269688) internal successors, (1168), 931 states have internal predecessors, (1168), 81 states have call successors, (81), 26 states have call predecessors, (81), 26 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-10 09:21:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1330 transitions. [2024-11-10 09:21:16,472 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1330 transitions. Word has length 131 [2024-11-10 09:21:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:16,472 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1330 transitions. [2024-11-10 09:21:16,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1330 transitions. [2024-11-10 09:21:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:21:16,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:16,474 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:16,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 09:21:16,474 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:16,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash 836030479, now seen corresponding path program 1 times [2024-11-10 09:21:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533343414] [2024-11-10 09:21:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533343414] [2024-11-10 09:21:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533343414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371163030] [2024-11-10 09:21:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:16,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:16,651 INFO L87 Difference]: Start difference. First operand 1035 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:16,775 INFO L93 Difference]: Finished difference Result 1558 states and 2007 transitions. [2024-11-10 09:21:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:16,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 134 [2024-11-10 09:21:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:16,779 INFO L225 Difference]: With dead ends: 1558 [2024-11-10 09:21:16,780 INFO L226 Difference]: Without dead ends: 1042 [2024-11-10 09:21:16,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:16,781 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 96 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:16,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 349 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-10 09:21:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1035. [2024-11-10 09:21:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 927 states have (on average 1.2513484358144553) internal successors, (1160), 931 states have internal predecessors, (1160), 81 states have call successors, (81), 26 states have call predecessors, (81), 26 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-10 09:21:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1322 transitions. [2024-11-10 09:21:16,829 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1322 transitions. Word has length 134 [2024-11-10 09:21:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1322 transitions. [2024-11-10 09:21:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1322 transitions. [2024-11-10 09:21:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:16,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:16,832 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 09:21:16,833 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1601928667, now seen corresponding path program 1 times [2024-11-10 09:21:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660316506] [2024-11-10 09:21:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660316506] [2024-11-10 09:21:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660316506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201427727] [2024-11-10 09:21:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:17,038 INFO L87 Difference]: Start difference. First operand 1035 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:17,209 INFO L93 Difference]: Finished difference Result 1558 states and 1995 transitions. [2024-11-10 09:21:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 135 [2024-11-10 09:21:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:17,215 INFO L225 Difference]: With dead ends: 1558 [2024-11-10 09:21:17,215 INFO L226 Difference]: Without dead ends: 1042 [2024-11-10 09:21:17,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:17,222 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 94 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:17,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 442 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-10 09:21:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1035. [2024-11-10 09:21:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 927 states have (on average 1.2427184466019416) internal successors, (1152), 931 states have internal predecessors, (1152), 81 states have call successors, (81), 26 states have call predecessors, (81), 26 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-10 09:21:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1314 transitions. [2024-11-10 09:21:17,264 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1314 transitions. Word has length 135 [2024-11-10 09:21:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:17,264 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1314 transitions. [2024-11-10 09:21:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1314 transitions. [2024-11-10 09:21:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:21:17,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:17,265 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:17,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:21:17,265 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:17,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash 285089135, now seen corresponding path program 1 times [2024-11-10 09:21:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:17,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303690209] [2024-11-10 09:21:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303690209] [2024-11-10 09:21:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303690209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2813299] [2024-11-10 09:21:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:17,527 INFO L87 Difference]: Start difference. First operand 1035 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:17,736 INFO L93 Difference]: Finished difference Result 1546 states and 1963 transitions. [2024-11-10 09:21:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2024-11-10 09:21:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:17,741 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 09:21:17,741 INFO L226 Difference]: Without dead ends: 1042 [2024-11-10 09:21:17,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:17,743 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 91 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:17,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 545 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-10 09:21:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1035. [2024-11-10 09:21:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 927 states have (on average 1.2340884573894282) internal successors, (1144), 931 states have internal predecessors, (1144), 81 states have call successors, (81), 26 states have call predecessors, (81), 26 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-10 09:21:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1306 transitions. [2024-11-10 09:21:17,806 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1306 transitions. Word has length 136 [2024-11-10 09:21:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:17,806 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1306 transitions. [2024-11-10 09:21:17,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1306 transitions. [2024-11-10 09:21:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:21:17,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:17,808 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:17,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 09:21:17,808 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -769436430, now seen corresponding path program 1 times [2024-11-10 09:21:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987499644] [2024-11-10 09:21:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 09:21:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987499644] [2024-11-10 09:21:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987499644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:21:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223370015] [2024-11-10 09:21:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:21:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:21:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:21:18,480 INFO L87 Difference]: Start difference. First operand 1035 states and 1306 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:19,088 INFO L93 Difference]: Finished difference Result 2343 states and 2970 transitions. [2024-11-10 09:21:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 09:21:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 138 [2024-11-10 09:21:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:19,094 INFO L225 Difference]: With dead ends: 2343 [2024-11-10 09:21:19,094 INFO L226 Difference]: Without dead ends: 1860 [2024-11-10 09:21:19,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 09:21:19,096 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 378 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:19,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1579 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:21:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-10 09:21:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 812. [2024-11-10 09:21:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 727 states have (on average 1.2517193947730398) internal successors, (910), 730 states have internal predecessors, (910), 64 states have call successors, (64), 20 states have call predecessors, (64), 20 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:21:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1038 transitions. [2024-11-10 09:21:19,131 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1038 transitions. Word has length 138 [2024-11-10 09:21:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:19,132 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1038 transitions. [2024-11-10 09:21:19,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 09:21:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1038 transitions. [2024-11-10 09:21:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 09:21:19,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:19,134 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:19,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 09:21:19,134 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1756048591, now seen corresponding path program 1 times [2024-11-10 09:21:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:19,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762587653] [2024-11-10 09:21:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat