./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-p_file-66.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 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:59:09,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:59:09,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:59:09,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:59:09,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:59:09,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:59:09,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:59:09,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:59:09,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:59:09,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:59:09,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:59:09,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:59:09,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:59:09,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:59:09,659 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:59:09,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:59:09,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:59:09,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:59:09,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:59:09,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:59:09,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:59:09,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:59:09,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:59:09,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:59:09,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:59:09,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:59:09,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:59:09,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:59:09,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:59:09,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:59:09,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:59:09,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:59:09,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:59:09,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:59:09,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:59:09,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:59:09,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:59:09,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:59:09,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:59:09,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:59:09,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:59:09,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:59:09,668 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 -> 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a [2024-11-19 00:59:09,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:59:09,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:59:09,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:59:09,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:59:09,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:59:09,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2024-11-19 00:59:11,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:59:11,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:59:11,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2024-11-19 00:59:11,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d47798b/001ef657737a449883521d0bda5cbcdf/FLAG14064c286 [2024-11-19 00:59:11,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d47798b/001ef657737a449883521d0bda5cbcdf [2024-11-19 00:59:11,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:59:11,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:59:11,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:59:11,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:59:11,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:59:11,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:11,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a1f4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11, skipping insertion in model container [2024-11-19 00:59:11,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:11,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:59:11,863 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-p_file-66.i[916,929] [2024-11-19 00:59:11,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:59:11,910 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:59:11,919 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-p_file-66.i[916,929] [2024-11-19 00:59:11,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:59:11,957 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:59:11,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11 WrapperNode [2024-11-19 00:59:11,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:59:11,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:59:11,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:59:11,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:59:11,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:11,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,012 INFO L138 Inliner]: procedures = 26, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-11-19 00:59:12,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:59:12,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:59:12,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:59:12,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:59:12,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,053 INFO L175 MemorySlicer]: Split 123 memory accesses to 13 slices as follows [2, 7, 10, 8, 14, 8, 16, 8, 8, 14, 8, 13, 7]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1]. [2024-11-19 00:59:12,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:59:12,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:59:12,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:59:12,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:59:12,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (1/1) ... [2024-11-19 00:59:12,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:59:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:12,116 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-19 00:59:12,118 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-19 00:59:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:59:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:59:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:59:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:59:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:59:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:59:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:59:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:59:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:59:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:59:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:59:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:59:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:59:12,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:59:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:59:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:59:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:59:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:59:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:59:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:59:12,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:59:12,277 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:59:12,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:59:12,640 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 00:59:12,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:59:12,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:59:12,654 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:59:12,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:59:12 BoogieIcfgContainer [2024-11-19 00:59:12,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:59:12,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:59:12,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:59:12,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:59:12,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:59:11" (1/3) ... [2024-11-19 00:59:12,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c686da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:59:12, skipping insertion in model container [2024-11-19 00:59:12,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:11" (2/3) ... [2024-11-19 00:59:12,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c686da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:59:12, skipping insertion in model container [2024-11-19 00:59:12,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:59:12" (3/3) ... [2024-11-19 00:59:12,673 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-66.i [2024-11-19 00:59:12,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:59:12,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:59:12,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:59:12,740 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;@2878bc7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:59:12,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:59:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:59:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:59:12,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:12,751 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:12,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 566813761, now seen corresponding path program 1 times [2024-11-19 00:59:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206656834] [2024-11-19 00:59:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:59:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206656834] [2024-11-19 00:59:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206656834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:59:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193037594] [2024-11-19 00:59:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:13,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:13,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:13,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:59:13,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:59:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:13,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:59:13,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:59:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:59:13,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:59:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193037594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:13,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:59:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:59:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573373556] [2024-11-19 00:59:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:59:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:59:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:59:13,255 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:59:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:13,295 INFO L93 Difference]: Finished difference Result 165 states and 258 transitions. [2024-11-19 00:59:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:59:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-11-19 00:59:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:13,326 INFO L225 Difference]: With dead ends: 165 [2024-11-19 00:59:13,326 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 00:59:13,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-19 00:59:13,337 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:13,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 00:59:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 00:59:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:59:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-19 00:59:13,376 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2024-11-19 00:59:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:13,376 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-19 00:59:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:59:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-19 00:59:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:59:13,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:13,379 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:13,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:59:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:59:13,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 584676645, now seen corresponding path program 1 times [2024-11-19 00:59:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441917707] [2024-11-19 00:59:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441917707] [2024-11-19 00:59:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441917707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:59:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644235588] [2024-11-19 00:59:13,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:13,805 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:13,835 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-11-19 00:59:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-19 00:59:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:13,840 INFO L225 Difference]: With dead ends: 164 [2024-11-19 00:59:13,840 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 00:59:13,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:13,842 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:13,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 00:59:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-19 00:59:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:59:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-19 00:59:13,851 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2024-11-19 00:59:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-19 00:59:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-19 00:59:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:59:13,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:13,856 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:13,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:59:13,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1935283289, now seen corresponding path program 1 times [2024-11-19 00:59:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368916305] [2024-11-19 00:59:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368916305] [2024-11-19 00:59:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368916305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:14,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:59:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171225885] [2024-11-19 00:59:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:14,064 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:14,091 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2024-11-19 00:59:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-19 00:59:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:14,095 INFO L225 Difference]: With dead ends: 168 [2024-11-19 00:59:14,095 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 00:59:14,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:14,097 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:14,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 00:59:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-19 00:59:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:59:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-19 00:59:14,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2024-11-19 00:59:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:14,110 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-19 00:59:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-19 00:59:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:59:14,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:14,113 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:14,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:59:14,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:14,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1933436247, now seen corresponding path program 1 times [2024-11-19 00:59:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:14,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570001562] [2024-11-19 00:59:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:14,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570001562] [2024-11-19 00:59:14,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570001562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:14,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:14,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:59:14,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780169682] [2024-11-19 00:59:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:14,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:14,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:14,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:14,425 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:14,547 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2024-11-19 00:59:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-19 00:59:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:14,549 INFO L225 Difference]: With dead ends: 252 [2024-11-19 00:59:14,550 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 00:59:14,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:14,551 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 77 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:14,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 363 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:59:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 00:59:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-19 00:59:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:59:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2024-11-19 00:59:14,563 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 109 [2024-11-19 00:59:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:14,563 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2024-11-19 00:59:14,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2024-11-19 00:59:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:59:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:14,565 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:59:14,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 716307048, now seen corresponding path program 1 times [2024-11-19 00:59:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239594305] [2024-11-19 00:59:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239594305] [2024-11-19 00:59:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239594305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:59:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274515954] [2024-11-19 00:59:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:16,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:59:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:59:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:59:16,032 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 15 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-19 00:59:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:16,892 INFO L93 Difference]: Finished difference Result 497 states and 707 transitions. [2024-11-19 00:59:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:59:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 15 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 110 [2024-11-19 00:59:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:16,894 INFO L225 Difference]: With dead ends: 497 [2024-11-19 00:59:16,894 INFO L226 Difference]: Without dead ends: 339 [2024-11-19 00:59:16,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:59:16,896 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 702 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:16,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 905 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:59:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-19 00:59:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 177. [2024-11-19 00:59:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 146 states have internal predecessors, (196), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:59:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 252 transitions. [2024-11-19 00:59:16,909 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 252 transitions. Word has length 110 [2024-11-19 00:59:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 252 transitions. [2024-11-19 00:59:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 15 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-19 00:59:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 252 transitions. [2024-11-19 00:59:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:59:16,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:16,911 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:59:16,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 129501034, now seen corresponding path program 1 times [2024-11-19 00:59:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614137866] [2024-11-19 00:59:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614137866] [2024-11-19 00:59:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614137866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:59:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504907769] [2024-11-19 00:59:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:59:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:59:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:59:17,408 INFO L87 Difference]: Start difference. First operand 177 states and 252 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:17,896 INFO L93 Difference]: Finished difference Result 513 states and 717 transitions. [2024-11-19 00:59:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:59:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2024-11-19 00:59:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:17,898 INFO L225 Difference]: With dead ends: 513 [2024-11-19 00:59:17,899 INFO L226 Difference]: Without dead ends: 339 [2024-11-19 00:59:17,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:59:17,900 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 548 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:17,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 581 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:59:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-19 00:59:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 266. [2024-11-19 00:59:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 213 states have internal predecessors, (272), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:59:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 368 transitions. [2024-11-19 00:59:17,927 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 368 transitions. Word has length 110 [2024-11-19 00:59:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 368 transitions. [2024-11-19 00:59:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 368 transitions. [2024-11-19 00:59:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:59:17,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:17,930 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:59:17,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1132244947, now seen corresponding path program 1 times [2024-11-19 00:59:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681677037] [2024-11-19 00:59:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681677037] [2024-11-19 00:59:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681677037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:59:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258004126] [2024-11-19 00:59:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:18,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:59:18,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:59:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:59:18,118 INFO L87 Difference]: Start difference. First operand 266 states and 368 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:18,194 INFO L93 Difference]: Finished difference Result 591 states and 810 transitions. [2024-11-19 00:59:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:59:18,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-19 00:59:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:18,202 INFO L225 Difference]: With dead ends: 591 [2024-11-19 00:59:18,202 INFO L226 Difference]: Without dead ends: 341 [2024-11-19 00:59:18,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:59:18,204 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:18,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 483 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-19 00:59:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2024-11-19 00:59:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 275 states have (on average 1.2872727272727273) internal successors, (354), 278 states have internal predecessors, (354), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:59:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 458 transitions. [2024-11-19 00:59:18,243 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 458 transitions. Word has length 111 [2024-11-19 00:59:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:18,244 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 458 transitions. [2024-11-19 00:59:18,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2024-11-19 00:59:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:59:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:18,246 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:18,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:59:18,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 111176593, now seen corresponding path program 1 times [2024-11-19 00:59:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140507917] [2024-11-19 00:59:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140507917] [2024-11-19 00:59:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140507917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:59:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118596590] [2024-11-19 00:59:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:18,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:18,405 INFO L87 Difference]: Start difference. First operand 338 states and 458 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:18,491 INFO L93 Difference]: Finished difference Result 586 states and 797 transitions. [2024-11-19 00:59:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-19 00:59:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:18,493 INFO L225 Difference]: With dead ends: 586 [2024-11-19 00:59:18,493 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 00:59:18,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:18,494 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 75 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:18,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 361 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:59:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 00:59:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2024-11-19 00:59:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 214 states have (on average 1.2897196261682242) internal successors, (276), 216 states have internal predecessors, (276), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:59:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 352 transitions. [2024-11-19 00:59:18,515 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 352 transitions. Word has length 111 [2024-11-19 00:59:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:18,516 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 352 transitions. [2024-11-19 00:59:18,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2024-11-19 00:59:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:59:18,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:18,517 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:18,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:59:18,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1141588530, now seen corresponding path program 1 times [2024-11-19 00:59:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104007449] [2024-11-19 00:59:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:18,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104007449] [2024-11-19 00:59:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104007449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:59:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118726796] [2024-11-19 00:59:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:59:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:18,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:59:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:59:18,576 INFO L87 Difference]: Start difference. First operand 260 states and 352 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:18,596 INFO L93 Difference]: Finished difference Result 503 states and 685 transitions. [2024-11-19 00:59:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:59:18,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-19 00:59:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:18,598 INFO L225 Difference]: With dead ends: 503 [2024-11-19 00:59:18,598 INFO L226 Difference]: Without dead ends: 263 [2024-11-19 00:59:18,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:59:18,599 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:18,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-19 00:59:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-19 00:59:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 219 states have internal predecessors, (279), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:59:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 355 transitions. [2024-11-19 00:59:18,615 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 355 transitions. Word has length 113 [2024-11-19 00:59:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:18,615 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 355 transitions. [2024-11-19 00:59:18,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 355 transitions. [2024-11-19 00:59:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:59:18,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:18,616 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:18,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:59:18,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1728394544, now seen corresponding path program 1 times [2024-11-19 00:59:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516489726] [2024-11-19 00:59:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 00:59:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516489726] [2024-11-19 00:59:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516489726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:59:18,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007975017] [2024-11-19 00:59:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:18,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:59:18,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:59:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:18,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:59:18,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:59:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:18,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:59:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007975017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:18,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:59:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:59:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422575049] [2024-11-19 00:59:18,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:18,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:59:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:59:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:59:18,920 INFO L87 Difference]: Start difference. First operand 263 states and 355 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:18,951 INFO L93 Difference]: Finished difference Result 515 states and 697 transitions. [2024-11-19 00:59:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:59:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-19 00:59:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:18,952 INFO L225 Difference]: With dead ends: 515 [2024-11-19 00:59:18,952 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 00:59:18,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:59:18,953 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 00:59:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-19 00:59:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 228 states have internal predecessors, (288), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:59:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 364 transitions. [2024-11-19 00:59:18,968 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 364 transitions. Word has length 113 [2024-11-19 00:59:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:18,968 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 364 transitions. [2024-11-19 00:59:18,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 364 transitions. [2024-11-19 00:59:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:59:18,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:18,969 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:18,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:59:19,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 00:59:19,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1956569533, now seen corresponding path program 1 times [2024-11-19 00:59:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71520255] [2024-11-19 00:59:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71520255] [2024-11-19 00:59:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71520255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:20,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 00:59:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061245573] [2024-11-19 00:59:20,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:20,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 00:59:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 00:59:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:59:20,109 INFO L87 Difference]: Start difference. First operand 272 states and 364 transitions. Second operand has 18 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-19 00:59:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:21,140 INFO L93 Difference]: Finished difference Result 558 states and 751 transitions. [2024-11-19 00:59:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:59:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 113 [2024-11-19 00:59:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:21,144 INFO L225 Difference]: With dead ends: 558 [2024-11-19 00:59:21,144 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 00:59:21,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2024-11-19 00:59:21,145 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 350 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:21,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 962 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:59:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 00:59:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 272. [2024-11-19 00:59:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 226 states have (on average 1.2654867256637168) internal successors, (286), 228 states have internal predecessors, (286), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:59:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 362 transitions. [2024-11-19 00:59:21,168 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 362 transitions. Word has length 113 [2024-11-19 00:59:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:21,169 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 362 transitions. [2024-11-19 00:59:21,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-19 00:59:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 362 transitions. [2024-11-19 00:59:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:59:21,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:21,171 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:21,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:59:21,171 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1369763519, now seen corresponding path program 1 times [2024-11-19 00:59:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260991334] [2024-11-19 00:59:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260991334] [2024-11-19 00:59:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260991334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:21,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:21,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:59:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898796760] [2024-11-19 00:59:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:21,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:59:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:21,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:59:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:59:21,405 INFO L87 Difference]: Start difference. First operand 272 states and 362 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:21,493 INFO L93 Difference]: Finished difference Result 509 states and 683 transitions. [2024-11-19 00:59:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:59:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-19 00:59:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:21,495 INFO L225 Difference]: With dead ends: 509 [2024-11-19 00:59:21,495 INFO L226 Difference]: Without dead ends: 344 [2024-11-19 00:59:21,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 00:59:21,496 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 48 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:21,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 556 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-19 00:59:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 268. [2024-11-19 00:59:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 222 states have (on average 1.2612612612612613) internal successors, (280), 224 states have internal predecessors, (280), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:59:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 356 transitions. [2024-11-19 00:59:21,515 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 356 transitions. Word has length 113 [2024-11-19 00:59:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:21,516 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 356 transitions. [2024-11-19 00:59:21,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 356 transitions. [2024-11-19 00:59:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:59:21,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:21,517 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:21,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:59:21,518 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:21,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1567346285, now seen corresponding path program 1 times [2024-11-19 00:59:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828357311] [2024-11-19 00:59:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828357311] [2024-11-19 00:59:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828357311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:59:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338975556] [2024-11-19 00:59:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:21,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:59:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:59:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:59:21,877 INFO L87 Difference]: Start difference. First operand 268 states and 356 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:22,138 INFO L93 Difference]: Finished difference Result 499 states and 664 transitions. [2024-11-19 00:59:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:59:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 115 [2024-11-19 00:59:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:22,140 INFO L225 Difference]: With dead ends: 499 [2024-11-19 00:59:22,140 INFO L226 Difference]: Without dead ends: 338 [2024-11-19 00:59:22,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:59:22,141 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 337 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:22,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 602 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:59:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-19 00:59:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 264. [2024-11-19 00:59:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 225 states have (on average 1.2844444444444445) internal successors, (289), 226 states have internal predecessors, (289), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:59:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2024-11-19 00:59:22,159 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 115 [2024-11-19 00:59:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:22,159 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2024-11-19 00:59:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2024-11-19 00:59:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:59:22,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:22,161 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:59:22,161 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2043987111, now seen corresponding path program 1 times [2024-11-19 00:59:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746504783] [2024-11-19 00:59:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746504783] [2024-11-19 00:59:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746504783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:59:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919865338] [2024-11-19 00:59:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:59:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:59:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:59:22,531 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:59:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:22,923 INFO L93 Difference]: Finished difference Result 587 states and 786 transitions. [2024-11-19 00:59:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:59:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-19 00:59:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:22,925 INFO L225 Difference]: With dead ends: 587 [2024-11-19 00:59:22,925 INFO L226 Difference]: Without dead ends: 413 [2024-11-19 00:59:22,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:59:22,926 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 698 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:22,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 680 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:59:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-19 00:59:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 276. [2024-11-19 00:59:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 237 states have (on average 1.2869198312236287) internal successors, (305), 238 states have internal predecessors, (305), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:59:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 369 transitions. [2024-11-19 00:59:22,961 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 369 transitions. Word has length 115 [2024-11-19 00:59:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 369 transitions. [2024-11-19 00:59:22,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:59:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 369 transitions. [2024-11-19 00:59:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:59:22,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:22,962 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:22,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:59:22,963 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash 754447436, now seen corresponding path program 1 times [2024-11-19 00:59:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:22,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21819586] [2024-11-19 00:59:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21819586] [2024-11-19 00:59:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21819586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:59:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668272137] [2024-11-19 00:59:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:59:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:59:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:59:23,264 INFO L87 Difference]: Start difference. First operand 276 states and 369 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:59:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:23,414 INFO L93 Difference]: Finished difference Result 550 states and 735 transitions. [2024-11-19 00:59:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:59:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-11-19 00:59:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:23,415 INFO L225 Difference]: With dead ends: 550 [2024-11-19 00:59:23,415 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 00:59:23,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:59:23,417 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 269 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:23,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 498 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:59:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 00:59:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2024-11-19 00:59:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 236 states have internal predecessors, (301), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:59:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 365 transitions. [2024-11-19 00:59:23,436 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 365 transitions. Word has length 116 [2024-11-19 00:59:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:23,436 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 365 transitions. [2024-11-19 00:59:23,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 00:59:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 365 transitions. [2024-11-19 00:59:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:59:23,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:23,437 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:59:23,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -525416242, now seen corresponding path program 1 times [2024-11-19 00:59:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515032231] [2024-11-19 00:59:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515032231] [2024-11-19 00:59:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515032231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:23,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:59:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149756148] [2024-11-19 00:59:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:23,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:59:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:59:23,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:59:23,670 INFO L87 Difference]: Start difference. First operand 274 states and 365 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:23,815 INFO L93 Difference]: Finished difference Result 524 states and 695 transitions. [2024-11-19 00:59:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:59:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-11-19 00:59:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:23,817 INFO L225 Difference]: With dead ends: 524 [2024-11-19 00:59:23,817 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 00:59:23,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:59:23,818 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 333 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:23,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 381 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:59:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 00:59:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2024-11-19 00:59:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 212 states have internal predecessors, (265), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:59:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2024-11-19 00:59:23,837 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 116 [2024-11-19 00:59:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:23,837 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2024-11-19 00:59:23,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 00:59:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2024-11-19 00:59:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:59:23,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:23,838 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:59:23,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:23,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 70813536, now seen corresponding path program 1 times [2024-11-19 00:59:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547194669] [2024-11-19 00:59:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:59:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547194669] [2024-11-19 00:59:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547194669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:59:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840618610] [2024-11-19 00:59:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:59:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:59:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:59:23,957 INFO L87 Difference]: Start difference. First operand 250 states and 329 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:24,032 INFO L93 Difference]: Finished difference Result 504 states and 664 transitions. [2024-11-19 00:59:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:24,033 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 00:59:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:24,034 INFO L225 Difference]: With dead ends: 504 [2024-11-19 00:59:24,034 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 00:59:24,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:59:24,035 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 93 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:24,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 440 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 00:59:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2024-11-19 00:59:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 211 states have (on average 1.2511848341232228) internal successors, (264), 212 states have internal predecessors, (264), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:59:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 328 transitions. [2024-11-19 00:59:24,054 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 328 transitions. Word has length 116 [2024-11-19 00:59:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:24,054 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 328 transitions. [2024-11-19 00:59:24,054 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:59:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2024-11-19 00:59:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:59:24,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:24,055 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:59:24,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2102425942, now seen corresponding path program 1 times [2024-11-19 00:59:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833711425] [2024-11-19 00:59:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat