./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:38:46,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:38:46,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:38:46,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:38:46,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:38:46,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:38:46,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:38:46,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:38:46,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:38:46,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:38:46,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:38:46,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:38:46,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:38:46,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:38:46,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:38:46,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:38:46,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:38:46,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:38:46,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:38:46,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:38:46,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:38:46,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:38:46,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:38:46,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:38:46,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:38:46,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:38:46,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:38:46,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:38:46,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:38:46,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:38:46,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:38:46,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:38:46,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:38:46,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:38:46,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:38:46,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:38:46,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:38:46,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:38:46,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:38:46,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:38:46,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:38:46,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:38:46,295 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 -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2024-11-10 09:38:46,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:38:46,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:38:46,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:38:46,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:38:46,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:38:46,588 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-62.i [2024-11-10 09:38:48,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:38:48,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:38:48,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2024-11-10 09:38:48,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4fe26cf/7966be9a3c8a41969e351111c5c8c4d8/FLAG3ad7ab355 [2024-11-10 09:38:48,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4fe26cf/7966be9a3c8a41969e351111c5c8c4d8 [2024-11-10 09:38:48,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:38:48,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:38:48,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:38:48,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:38:48,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:38:48,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab4314b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48, skipping insertion in model container [2024-11-10 09:38:48,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:38:48,564 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-62.i[916,929] [2024-11-10 09:38:48,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:38:48,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:38:48,659 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-62.i[916,929] [2024-11-10 09:38:48,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:38:48,720 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:38:48,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48 WrapperNode [2024-11-10 09:38:48,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:38:48,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:38:48,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:38:48,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:38:48,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,786 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 349 [2024-11-10 09:38:48,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:38:48,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:38:48,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:38:48,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:38:48,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,840 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2024-11-10 09:38:48,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:38:48,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:38:48,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:38:48,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:38:48,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (1/1) ... [2024-11-10 09:38:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:38:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:38:48,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:38:48,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:38:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:38:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:38:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 09:38:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 09:38:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 09:38:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:38:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:38:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:38:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:38:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:38:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:38:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:38:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 09:38:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 09:38:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 09:38:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 09:38:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:38:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:38:49,154 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:38:49,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:38:49,472 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2024-11-10 09:38:49,523 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-10 09:38:49,523 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:38:49,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:38:49,540 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:38:49,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:38:49 BoogieIcfgContainer [2024-11-10 09:38:49,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:38:49,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:38:49,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:38:49,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:38:49,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:38:48" (1/3) ... [2024-11-10 09:38:49,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d8316a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:38:49, skipping insertion in model container [2024-11-10 09:38:49,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:38:48" (2/3) ... [2024-11-10 09:38:49,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d8316a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:38:49, skipping insertion in model container [2024-11-10 09:38:49,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:38:49" (3/3) ... [2024-11-10 09:38:49,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2024-11-10 09:38:49,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:38:49,568 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:38:49,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:38:49,632 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;@66cdd84d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:38:49,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:38:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:38:49,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:49,646 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:49,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -276076069, now seen corresponding path program 1 times [2024-11-10 09:38:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202037452] [2024-11-10 09:38:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:49,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202037452] [2024-11-10 09:38:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202037452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:38:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046336353] [2024-11-10 09:38:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:50,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:38:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:38:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:38:50,059 INFO L87 Difference]: Start difference. First operand has 76 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:38:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:50,086 INFO L93 Difference]: Finished difference Result 144 states and 215 transitions. [2024-11-10 09:38:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:38:50,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-10 09:38:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:50,095 INFO L225 Difference]: With dead ends: 144 [2024-11-10 09:38:50,096 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 09:38:50,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:38:50,102 INFO L432 NwaCegarLoop]: 99 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, 99 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-10 09:38:50,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 09:38:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 09:38:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-10 09:38:50,198 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 75 [2024-11-10 09:38:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:50,198 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-10 09:38:50,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:38:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-10 09:38:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:38:50,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:50,209 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:50,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:38:50,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:50,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1084411107, now seen corresponding path program 1 times [2024-11-10 09:38:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070081946] [2024-11-10 09:38:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070081946] [2024-11-10 09:38:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070081946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:38:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331577737] [2024-11-10 09:38:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:50,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:38:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:38:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:38:50,513 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:50,560 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-10 09:38:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:38:50,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-10 09:38:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:50,562 INFO L225 Difference]: With dead ends: 142 [2024-11-10 09:38:50,563 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 09:38:50,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:38:50,565 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 277 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-10 09:38:50,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 277 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 09:38:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-10 09:38:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-10 09:38:50,581 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 75 [2024-11-10 09:38:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:50,588 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-10 09:38:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-10 09:38:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:38:50,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:50,590 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:38:50,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1467745854, now seen corresponding path program 1 times [2024-11-10 09:38:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505067377] [2024-11-10 09:38:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:50,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:50,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505067377] [2024-11-10 09:38:50,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505067377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:50,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:50,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:38:50,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953169611] [2024-11-10 09:38:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:50,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:38:50,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:50,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:38:50,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:38:50,764 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:50,800 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2024-11-10 09:38:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:38:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-10 09:38:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:50,806 INFO L225 Difference]: With dead ends: 146 [2024-11-10 09:38:50,806 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 09:38:50,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:38:50,807 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 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-10 09:38:50,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 09:38:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-10 09:38:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-10 09:38:50,819 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 75 [2024-11-10 09:38:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:50,819 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-10 09:38:50,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-10 09:38:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:38:50,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:50,821 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:50,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:38:50,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:50,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:50,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1439116703, now seen corresponding path program 1 times [2024-11-10 09:38:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:50,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991910215] [2024-11-10 09:38:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991910215] [2024-11-10 09:38:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991910215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:38:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868195709] [2024-11-10 09:38:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:38:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:38:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:38:51,110 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:51,173 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2024-11-10 09:38:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:38:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-10 09:38:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:51,175 INFO L225 Difference]: With dead ends: 175 [2024-11-10 09:38:51,175 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 09:38:51,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:51,177 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 91 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:51,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 294 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 09:38:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2024-11-10 09:38:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2024-11-10 09:38:51,186 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 75 [2024-11-10 09:38:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:51,187 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2024-11-10 09:38:51,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2024-11-10 09:38:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 09:38:51,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:51,188 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:38:51,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 700686627, now seen corresponding path program 1 times [2024-11-10 09:38:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136720683] [2024-11-10 09:38:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136720683] [2024-11-10 09:38:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136720683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:51,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:38:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792133804] [2024-11-10 09:38:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:38:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:38:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:38:51,480 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:51,576 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions. [2024-11-10 09:38:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:38:51,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-10 09:38:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:51,580 INFO L225 Difference]: With dead ends: 222 [2024-11-10 09:38:51,580 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 09:38:51,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:38:51,581 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 92 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:51,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 615 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:38:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 09:38:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 85. [2024-11-10 09:38:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2024-11-10 09:38:51,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 77 [2024-11-10 09:38:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:51,603 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2024-11-10 09:38:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-10 09:38:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:38:51,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:51,606 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:38:51,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1637739180, now seen corresponding path program 1 times [2024-11-10 09:38:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123011258] [2024-11-10 09:38:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123011258] [2024-11-10 09:38:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123011258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:38:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614236052] [2024-11-10 09:38:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:51,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:38:51,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:38:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:51,789 INFO L87 Difference]: Start difference. First operand 85 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:51,816 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2024-11-10 09:38:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:38:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-10 09:38:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:51,818 INFO L225 Difference]: With dead ends: 170 [2024-11-10 09:38:51,818 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 09:38:51,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:51,820 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 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-10 09:38:51,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 09:38:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 09:38:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2024-11-10 09:38:51,826 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 79 [2024-11-10 09:38:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:51,827 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2024-11-10 09:38:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2024-11-10 09:38:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:38:51,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:51,829 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:51,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:38:51,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 346038566, now seen corresponding path program 1 times [2024-11-10 09:38:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082803892] [2024-11-10 09:38:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082803892] [2024-11-10 09:38:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082803892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:52,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:38:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134948432] [2024-11-10 09:38:52,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:52,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:38:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:52,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:38:52,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:52,128 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:52,194 INFO L93 Difference]: Finished difference Result 208 states and 279 transitions. [2024-11-10 09:38:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:38:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-10 09:38:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:52,198 INFO L225 Difference]: With dead ends: 208 [2024-11-10 09:38:52,198 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 09:38:52,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:38:52,200 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:52,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 379 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 09:38:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 88. [2024-11-10 09:38:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2024-11-10 09:38:52,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 79 [2024-11-10 09:38:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:52,217 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2024-11-10 09:38:52,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2024-11-10 09:38:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:38:52,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:52,219 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:52,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:38:52,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash 209122784, now seen corresponding path program 1 times [2024-11-10 09:38:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84893103] [2024-11-10 09:38:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84893103] [2024-11-10 09:38:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84893103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:38:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921433870] [2024-11-10 09:38:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:38:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:38:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:52,446 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:52,505 INFO L93 Difference]: Finished difference Result 208 states and 277 transitions. [2024-11-10 09:38:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:38:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-10 09:38:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:52,506 INFO L225 Difference]: With dead ends: 208 [2024-11-10 09:38:52,506 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 09:38:52,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:38:52,508 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 51 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:52,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 476 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 09:38:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 88. [2024-11-10 09:38:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2024-11-10 09:38:52,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 79 [2024-11-10 09:38:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2024-11-10 09:38:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2024-11-10 09:38:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:38:52,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:52,519 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:52,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:38:52,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:52,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1504436614, now seen corresponding path program 1 times [2024-11-10 09:38:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:52,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33662836] [2024-11-10 09:38:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33662836] [2024-11-10 09:38:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33662836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:38:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906952386] [2024-11-10 09:38:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:38:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:38:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:38:52,714 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:52,750 INFO L93 Difference]: Finished difference Result 177 states and 236 transitions. [2024-11-10 09:38:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:38:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-11-10 09:38:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:52,752 INFO L225 Difference]: With dead ends: 177 [2024-11-10 09:38:52,752 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 09:38:52,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:38:52,753 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:52,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 09:38:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-10 09:38:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-11-10 09:38:52,758 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 81 [2024-11-10 09:38:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-11-10 09:38:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-11-10 09:38:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:38:52,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:52,760 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:38:52,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1055454217, now seen corresponding path program 1 times [2024-11-10 09:38:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664747438] [2024-11-10 09:38:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:38:53,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664747438] [2024-11-10 09:38:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664747438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:38:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305272055] [2024-11-10 09:38:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:53,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:38:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:38:53,496 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-10 09:38:53,498 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-10 09:38:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:53,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 09:38:53,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:38:54,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:54,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:38:54,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:38:54,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:38:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 09:38:54,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:38:54,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-10 09:38:54,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-10 09:38:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-10 09:38:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:38:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305272055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:38:55,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:38:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2024-11-10 09:38:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515549219] [2024-11-10 09:38:55,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:38:55,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 09:38:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 09:38:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2024-11-10 09:38:55,037 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-10 09:38:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:55,956 INFO L93 Difference]: Finished difference Result 250 states and 323 transitions. [2024-11-10 09:38:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 09:38:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 81 [2024-11-10 09:38:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:55,958 INFO L225 Difference]: With dead ends: 250 [2024-11-10 09:38:55,958 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 09:38:55,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 09:38:55,960 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 871 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:55,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 537 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:38:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 09:38:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2024-11-10 09:38:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 136 states have internal predecessors, (169), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:38:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2024-11-10 09:38:55,982 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 81 [2024-11-10 09:38:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:55,982 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2024-11-10 09:38:55,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-10 09:38:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2024-11-10 09:38:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:38:55,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:55,984 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:56,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:38:56,186 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,SelfDestructingSolverStorable9 [2024-11-10 09:38:56,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1026825066, now seen corresponding path program 1 times [2024-11-10 09:38:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194996943] [2024-11-10 09:38:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:56,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:56,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194996943] [2024-11-10 09:38:56,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194996943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:56,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:56,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:38:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169216131] [2024-11-10 09:38:56,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:56,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:38:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:38:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:38:56,416 INFO L87 Difference]: Start difference. First operand 153 states and 197 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:56,471 INFO L93 Difference]: Finished difference Result 328 states and 420 transitions. [2024-11-10 09:38:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:38:56,471 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-11-10 09:38:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:56,474 INFO L225 Difference]: With dead ends: 328 [2024-11-10 09:38:56,474 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 09:38:56,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:38:56,475 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:56,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 377 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:38:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 09:38:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2024-11-10 09:38:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 164 transitions. [2024-11-10 09:38:56,484 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 164 transitions. Word has length 81 [2024-11-10 09:38:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:56,484 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 164 transitions. [2024-11-10 09:38:56,484 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2024-11-10 09:38:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:38:56,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:56,485 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:56,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:38:56,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:56,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash 715985269, now seen corresponding path program 1 times [2024-11-10 09:38:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993049302] [2024-11-10 09:38:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:38:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993049302] [2024-11-10 09:38:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993049302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:38:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099296523] [2024-11-10 09:38:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:38:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:38:57,200 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-10 09:38:57,201 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-10 09:38:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:57,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:38:57,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:38:57,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:57,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:57,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:38:57,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:38:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 09:38:57,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:38:57,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-10 09:38:58,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-10 09:38:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:38:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099296523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:38:58,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:38:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2024-11-10 09:38:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018120696] [2024-11-10 09:38:58,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:38:58,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 09:38:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:58,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 09:38:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:38:58,183 INFO L87 Difference]: Start difference. First operand 129 states and 164 transitions. Second operand has 24 states, 20 states have (on average 4.3) internal successors, (86), 22 states have internal predecessors, (86), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-10 09:38:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:58,746 INFO L93 Difference]: Finished difference Result 225 states and 286 transitions. [2024-11-10 09:38:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:38:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.3) internal successors, (86), 22 states have internal predecessors, (86), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) Word has length 81 [2024-11-10 09:38:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:58,748 INFO L225 Difference]: With dead ends: 225 [2024-11-10 09:38:58,748 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:38:58,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 09:38:58,749 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 226 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:58,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 512 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:38:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:38:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-10 09:38:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-11-10 09:38:58,759 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 81 [2024-11-10 09:38:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:58,759 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-11-10 09:38:58,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.3) internal successors, (86), 22 states have internal predecessors, (86), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-10 09:38:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-11-10 09:38:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:38:58,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:58,760 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:58,779 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-10 09:38:58,964 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,SelfDestructingSolverStorable11 [2024-11-10 09:38:58,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 321068831, now seen corresponding path program 1 times [2024-11-10 09:38:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126080352] [2024-11-10 09:38:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:38:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126080352] [2024-11-10 09:38:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126080352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:38:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451406483] [2024-11-10 09:38:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:38:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:38:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:38:59,203 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:59,293 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2024-11-10 09:38:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:38:59,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-10 09:38:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:59,294 INFO L225 Difference]: With dead ends: 195 [2024-11-10 09:38:59,294 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:38:59,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:38:59,295 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 55 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:59,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 328 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:38:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:38:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 09:38:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:38:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-11-10 09:38:59,307 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 82 [2024-11-10 09:38:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:59,307 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-11-10 09:38:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:38:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-11-10 09:38:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:38:59,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:59,309 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:59,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:38:59,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -531041167, now seen corresponding path program 1 times [2024-11-10 09:38:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527919310] [2024-11-10 09:38:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:39:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527919310] [2024-11-10 09:39:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527919310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163786350] [2024-11-10 09:39:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:39:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:39:00,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:39:00,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:39:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:00,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 09:39:00,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:39:00,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:39:00,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2024-11-10 09:39:00,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-11-10 09:39:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:39:00,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:39:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163786350] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:39:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 11] total 22 [2024-11-10 09:39:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849282588] [2024-11-10 09:39:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:39:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:39:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:39:00,867 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:01,200 INFO L93 Difference]: Finished difference Result 260 states and 317 transitions. [2024-11-10 09:39:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:39:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-10 09:39:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:01,202 INFO L225 Difference]: With dead ends: 260 [2024-11-10 09:39:01,202 INFO L226 Difference]: Without dead ends: 162 [2024-11-10 09:39:01,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-11-10 09:39:01,203 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 61 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:01,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 887 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:39:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-10 09:39:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 111. [2024-11-10 09:39:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:39:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-11-10 09:39:01,212 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 82 [2024-11-10 09:39:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:01,212 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-10 09:39:01,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2024-11-10 09:39:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:39:01,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:01,213 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:01,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 09:39:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:39:01,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:01,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1041575344, now seen corresponding path program 1 times [2024-11-10 09:39:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482716596] [2024-11-10 09:39:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482716596] [2024-11-10 09:39:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482716596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:01,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:39:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506451228] [2024-11-10 09:39:01,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:01,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:39:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:39:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:39:01,556 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:01,655 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-11-10 09:39:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:39:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-10 09:39:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:01,658 INFO L225 Difference]: With dead ends: 266 [2024-11-10 09:39:01,658 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 09:39:01,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:39:01,659 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 55 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:01,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 542 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 09:39:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 111. [2024-11-10 09:39:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 98 states have internal predecessors, (119), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:39:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2024-11-10 09:39:01,671 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 82 [2024-11-10 09:39:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:01,671 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2024-11-10 09:39:01,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2024-11-10 09:39:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:39:01,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:01,673 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:39:01,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -598047920, now seen corresponding path program 1 times [2024-11-10 09:39:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541009853] [2024-11-10 09:39:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541009853] [2024-11-10 09:39:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541009853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:01,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:01,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:39:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513185248] [2024-11-10 09:39:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:39:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:39:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:39:01,821 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:01,926 INFO L93 Difference]: Finished difference Result 285 states and 347 transitions. [2024-11-10 09:39:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:39:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-10 09:39:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:01,928 INFO L225 Difference]: With dead ends: 285 [2024-11-10 09:39:01,928 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 09:39:01,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:39:01,929 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 63 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:01,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 559 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 09:39:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 114. [2024-11-10 09:39:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 101 states have internal predecessors, (122), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:39:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2024-11-10 09:39:01,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 82 [2024-11-10 09:39:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:01,940 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2024-11-10 09:39:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2024-11-10 09:39:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:39:01,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:01,941 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:01,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:39:01,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:01,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1108582097, now seen corresponding path program 1 times [2024-11-10 09:39:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:01,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458268846] [2024-11-10 09:39:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:01,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458268846] [2024-11-10 09:39:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458268846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 09:39:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404298095] [2024-11-10 09:39:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:02,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:39:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:39:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:39:02,856 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:39:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:03,833 INFO L93 Difference]: Finished difference Result 603 states and 721 transitions. [2024-11-10 09:39:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 09:39:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2024-11-10 09:39:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:03,836 INFO L225 Difference]: With dead ends: 603 [2024-11-10 09:39:03,836 INFO L226 Difference]: Without dead ends: 492 [2024-11-10 09:39:03,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 09:39:03,837 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 725 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:03,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1336 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:39:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-10 09:39:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 235. [2024-11-10 09:39:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 210 states have (on average 1.2095238095238094) internal successors, (254), 210 states have internal predecessors, (254), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:39:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 286 transitions. [2024-11-10 09:39:03,855 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 286 transitions. Word has length 82 [2024-11-10 09:39:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:03,856 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 286 transitions. [2024-11-10 09:39:03,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:39:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 286 transitions. [2024-11-10 09:39:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 09:39:03,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:03,857 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:39:03,857 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:03,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash 263715141, now seen corresponding path program 1 times [2024-11-10 09:39:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571096145] [2024-11-10 09:39:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:39:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571096145] [2024-11-10 09:39:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571096145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547073211] [2024-11-10 09:39:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:39:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:39:04,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:39:04,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 09:39:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:05,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 09:39:05,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:39:05,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:39:05,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:39:05,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-11-10 09:39:05,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2024-11-10 09:39:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-10 09:39:05,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:39:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547073211] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:39:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 10] total 25 [2024-11-10 09:39:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617610006] [2024-11-10 09:39:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:05,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:39:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:39:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:39:05,609 INFO L87 Difference]: Start difference. First operand 235 states and 286 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:05,945 INFO L93 Difference]: Finished difference Result 560 states and 679 transitions. [2024-11-10 09:39:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:39:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2024-11-10 09:39:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:05,949 INFO L225 Difference]: With dead ends: 560 [2024-11-10 09:39:05,949 INFO L226 Difference]: Without dead ends: 328 [2024-11-10 09:39:05,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2024-11-10 09:39:05,951 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:05,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 972 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-10 09:39:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 110. [2024-11-10 09:39:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 states have internal predecessors, (117), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:39:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2024-11-10 09:39:05,965 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 83 [2024-11-10 09:39:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:05,965 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2024-11-10 09:39:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2024-11-10 09:39:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 09:39:05,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:05,967 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:05,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 09:39:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 09:39:06,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:06,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 703901040, now seen corresponding path program 1 times [2024-11-10 09:39:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808758231] [2024-11-10 09:39:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808758231] [2024-11-10 09:39:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808758231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574170433] [2024-11-10 09:39:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:06,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:06,306 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:06,355 INFO L93 Difference]: Finished difference Result 256 states and 309 transitions. [2024-11-10 09:39:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:06,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2024-11-10 09:39:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:06,357 INFO L225 Difference]: With dead ends: 256 [2024-11-10 09:39:06,357 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 09:39:06,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:06,358 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:06,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 333 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:39:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 09:39:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2024-11-10 09:39:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 97 states have internal predecessors, (116), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:39:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2024-11-10 09:39:06,368 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 84 [2024-11-10 09:39:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:06,368 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2024-11-10 09:39:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2024-11-10 09:39:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:39:06,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:06,370 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:06,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:39:06,370 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 555302059, now seen corresponding path program 1 times [2024-11-10 09:39:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:06,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916330880] [2024-11-10 09:39:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:06,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916330880] [2024-11-10 09:39:06,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916330880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:06,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:39:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953307572] [2024-11-10 09:39:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:06,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:39:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:39:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:39:06,816 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 09:39:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:07,084 INFO L93 Difference]: Finished difference Result 287 states and 341 transitions. [2024-11-10 09:39:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 09:39:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-11-10 09:39:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:07,086 INFO L225 Difference]: With dead ends: 287 [2024-11-10 09:39:07,086 INFO L226 Difference]: Without dead ends: 180 [2024-11-10 09:39:07,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:39:07,087 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 172 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:07,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 594 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-10 09:39:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2024-11-10 09:39:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.174496644295302) internal successors, (175), 150 states have internal predecessors, (175), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:39:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2024-11-10 09:39:07,106 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 85 [2024-11-10 09:39:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:07,106 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2024-11-10 09:39:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 09:39:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2024-11-10 09:39:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:39:07,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:07,107 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:07,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:39:07,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash -470078284, now seen corresponding path program 1 times [2024-11-10 09:39:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:07,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958631765] [2024-11-10 09:39:07,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958631765] [2024-11-10 09:39:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958631765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327403266] [2024-11-10 09:39:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:07,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:07,243 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:07,300 INFO L93 Difference]: Finished difference Result 403 states and 479 transitions. [2024-11-10 09:39:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-11-10 09:39:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:07,302 INFO L225 Difference]: With dead ends: 403 [2024-11-10 09:39:07,302 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 09:39:07,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:07,303 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 37 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:07,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 332 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:39:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 09:39:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 178. [2024-11-10 09:39:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.1635220125786163) internal successors, (185), 160 states have internal predecessors, (185), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:39:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 209 transitions. [2024-11-10 09:39:07,336 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 209 transitions. Word has length 85 [2024-11-10 09:39:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 209 transitions. [2024-11-10 09:39:07,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 209 transitions. [2024-11-10 09:39:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:39:07,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:07,338 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:07,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:39:07,338 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash 488295306, now seen corresponding path program 1 times [2024-11-10 09:39:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396653965] [2024-11-10 09:39:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:07,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396653965] [2024-11-10 09:39:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396653965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304295498] [2024-11-10 09:39:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:07,425 INFO L87 Difference]: Start difference. First operand 178 states and 209 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:07,518 INFO L93 Difference]: Finished difference Result 403 states and 472 transitions. [2024-11-10 09:39:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-11-10 09:39:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:07,521 INFO L225 Difference]: With dead ends: 403 [2024-11-10 09:39:07,521 INFO L226 Difference]: Without dead ends: 228 [2024-11-10 09:39:07,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:07,522 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:07,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 446 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-10 09:39:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 193. [2024-11-10 09:39:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.1551724137931034) internal successors, (201), 175 states have internal predecessors, (201), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:39:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2024-11-10 09:39:07,539 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 85 [2024-11-10 09:39:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:07,540 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2024-11-10 09:39:07,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2024-11-10 09:39:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 09:39:07,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:07,541 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:07,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:39:07,541 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:07,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1895441866, now seen corresponding path program 1 times [2024-11-10 09:39:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018239379] [2024-11-10 09:39:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018239379] [2024-11-10 09:39:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018239379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:39:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380179839] [2024-11-10 09:39:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:39:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:39:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:39:07,984 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:08,114 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2024-11-10 09:39:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:39:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2024-11-10 09:39:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:08,116 INFO L225 Difference]: With dead ends: 245 [2024-11-10 09:39:08,116 INFO L226 Difference]: Without dead ends: 242 [2024-11-10 09:39:08,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:39:08,117 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 66 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:08,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 504 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-10 09:39:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 225. [2024-11-10 09:39:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 197 states have (on average 1.1370558375634519) internal successors, (224), 199 states have internal predecessors, (224), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 260 transitions. [2024-11-10 09:39:08,145 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 260 transitions. Word has length 87 [2024-11-10 09:39:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:08,145 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 260 transitions. [2024-11-10 09:39:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 260 transitions. [2024-11-10 09:39:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 09:39:08,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:08,146 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:39:08,146 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:08,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash -124002380, now seen corresponding path program 1 times [2024-11-10 09:39:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748008026] [2024-11-10 09:39:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748008026] [2024-11-10 09:39:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748008026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:08,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:08,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:39:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015037571] [2024-11-10 09:39:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:39:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:39:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:39:08,443 INFO L87 Difference]: Start difference. First operand 225 states and 260 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:08,573 INFO L93 Difference]: Finished difference Result 550 states and 638 transitions. [2024-11-10 09:39:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:39:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2024-11-10 09:39:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:08,576 INFO L225 Difference]: With dead ends: 550 [2024-11-10 09:39:08,576 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 09:39:08,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:39:08,577 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 39 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:08,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 398 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 09:39:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2024-11-10 09:39:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 281 states have (on average 1.1387900355871887) internal successors, (320), 283 states have internal predecessors, (320), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 356 transitions. [2024-11-10 09:39:08,606 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 356 transitions. Word has length 87 [2024-11-10 09:39:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:08,606 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 356 transitions. [2024-11-10 09:39:08,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 356 transitions. [2024-11-10 09:39:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 09:39:08,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:08,608 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:08,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:39:08,608 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:08,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1596857066, now seen corresponding path program 1 times [2024-11-10 09:39:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225572896] [2024-11-10 09:39:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225572896] [2024-11-10 09:39:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225572896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:08,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:08,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201248489] [2024-11-10 09:39:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:08,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:08,756 INFO L87 Difference]: Start difference. First operand 309 states and 356 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:08,829 INFO L93 Difference]: Finished difference Result 646 states and 744 transitions. [2024-11-10 09:39:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2024-11-10 09:39:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:08,832 INFO L225 Difference]: With dead ends: 646 [2024-11-10 09:39:08,832 INFO L226 Difference]: Without dead ends: 366 [2024-11-10 09:39:08,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:08,833 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 35 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:08,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 432 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:39:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-10 09:39:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 271. [2024-11-10 09:39:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 243 states have (on average 1.1193415637860082) internal successors, (272), 245 states have internal predecessors, (272), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 308 transitions. [2024-11-10 09:39:08,863 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 308 transitions. Word has length 88 [2024-11-10 09:39:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 308 transitions. [2024-11-10 09:39:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 308 transitions. [2024-11-10 09:39:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:39:08,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:08,865 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:08,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:39:08,865 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:08,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -538196777, now seen corresponding path program 1 times [2024-11-10 09:39:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94839624] [2024-11-10 09:39:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:08,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94839624] [2024-11-10 09:39:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94839624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:39:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811936605] [2024-11-10 09:39:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:39:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:39:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:39:08,968 INFO L87 Difference]: Start difference. First operand 271 states and 308 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:09,030 INFO L93 Difference]: Finished difference Result 450 states and 513 transitions. [2024-11-10 09:39:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:39:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 89 [2024-11-10 09:39:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:09,032 INFO L225 Difference]: With dead ends: 450 [2024-11-10 09:39:09,032 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 09:39:09,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:39:09,033 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:09,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:39:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 09:39:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-10 09:39:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 180 states have (on average 1.1111111111111112) internal successors, (200), 182 states have internal predecessors, (200), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2024-11-10 09:39:09,060 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 89 [2024-11-10 09:39:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2024-11-10 09:39:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2024-11-10 09:39:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:39:09,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:09,062 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:39:09,062 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 273869522, now seen corresponding path program 1 times [2024-11-10 09:39:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246194577] [2024-11-10 09:39:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246194577] [2024-11-10 09:39:09,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246194577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:09,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:09,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887862267] [2024-11-10 09:39:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:09,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:09,169 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:09,264 INFO L93 Difference]: Finished difference Result 468 states and 527 transitions. [2024-11-10 09:39:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:09,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 89 [2024-11-10 09:39:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:09,267 INFO L225 Difference]: With dead ends: 468 [2024-11-10 09:39:09,267 INFO L226 Difference]: Without dead ends: 289 [2024-11-10 09:39:09,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:09,268 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 26 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:09,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 281 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-10 09:39:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 267. [2024-11-10 09:39:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.100418410041841) internal successors, (263), 241 states have internal predecessors, (263), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 299 transitions. [2024-11-10 09:39:09,295 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 299 transitions. Word has length 89 [2024-11-10 09:39:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:09,295 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 299 transitions. [2024-11-10 09:39:09,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 299 transitions. [2024-11-10 09:39:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 09:39:09,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:09,297 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 09:39:09,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -735695364, now seen corresponding path program 1 times [2024-11-10 09:39:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800510935] [2024-11-10 09:39:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:09,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:39:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800510935] [2024-11-10 09:39:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800510935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238485707] [2024-11-10 09:39:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:10,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:39:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:39:10,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:39:10,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 09:39:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:10,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 09:39:10,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:39:10,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:39:10,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-10 09:39:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 09:39:10,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 09:39:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-10 09:39:10,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:39:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238485707] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:39:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:39:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 11] total 21 [2024-11-10 09:39:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680290659] [2024-11-10 09:39:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:39:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:39:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:39:10,634 INFO L87 Difference]: Start difference. First operand 267 states and 299 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:10,798 INFO L93 Difference]: Finished difference Result 513 states and 576 transitions. [2024-11-10 09:39:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:39:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90 [2024-11-10 09:39:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:10,801 INFO L225 Difference]: With dead ends: 513 [2024-11-10 09:39:10,801 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 09:39:10,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:39:10,804 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 38 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:10,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 412 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 09:39:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2024-11-10 09:39:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 241 states have (on average 1.099585062240664) internal successors, (265), 243 states have internal predecessors, (265), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:39:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 301 transitions. [2024-11-10 09:39:10,833 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 301 transitions. Word has length 90 [2024-11-10 09:39:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:10,834 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 301 transitions. [2024-11-10 09:39:10,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 301 transitions. [2024-11-10 09:39:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 09:39:10,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:39:10,835 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:10,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 09:39:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 09:39:11,036 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:39:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:39:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2075634937, now seen corresponding path program 1 times [2024-11-10 09:39:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:39:11,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435383017] [2024-11-10 09:39:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:39:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:39:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:39:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:39:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:39:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:39:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:39:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:39:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:39:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:39:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:39:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:39:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:39:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435383017] [2024-11-10 09:39:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435383017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:39:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:39:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:39:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953266305] [2024-11-10 09:39:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:39:11,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:39:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:39:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:39:11,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:39:11,153 INFO L87 Difference]: Start difference. First operand 269 states and 301 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:39:11,254 INFO L93 Difference]: Finished difference Result 506 states and 562 transitions. [2024-11-10 09:39:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:39:11,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 92 [2024-11-10 09:39:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:39:11,255 INFO L225 Difference]: With dead ends: 506 [2024-11-10 09:39:11,255 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 09:39:11,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10 09:39:11,257 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 24 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:39:11,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:39:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 09:39:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 09:39:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 09:39:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 09:39:11,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-11-10 09:39:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:39:11,262 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 09:39:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:39:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 09:39:11,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 09:39:11,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:39:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:39:11,268 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:39:11,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.