./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.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-sp_file-76.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 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:01:30,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:01:30,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:01:30,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:01:30,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:01:30,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:01:30,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:01:30,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:01:30,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:01:30,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:01:30,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:01:30,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:01:30,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:01:30,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:01:30,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:01:30,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:01:30,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:01:30,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:01:30,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:01:30,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:01:30,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:01:30,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:01:30,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:01:30,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:01:30,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:01:30,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:01:30,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:01:30,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:01:30,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:01:30,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:01:30,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:01:30,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:01:30,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:30,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:01:30,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:01:30,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:01:30,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:01:30,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:01:30,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:01:30,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:01:30,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:01:30,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:01:30,968 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 -> 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 [2024-11-10 10:01:31,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:01:31,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:01:31,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:01:31,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:01:31,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:01:31,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2024-11-10 10:01:32,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:01:32,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:01:32,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2024-11-10 10:01:32,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94ac9efd/04d7a0679eda4e46877a3ef818e0f195/FLAGa55c6194b [2024-11-10 10:01:33,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94ac9efd/04d7a0679eda4e46877a3ef818e0f195 [2024-11-10 10:01:33,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:01:33,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:01:33,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:33,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:01:33,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:01:33,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7361b011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33, skipping insertion in model container [2024-11-10 10:01:33,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:01:33,217 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-sp_file-76.i[917,930] [2024-11-10 10:01:33,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:33,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:01:33,298 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-sp_file-76.i[917,930] [2024-11-10 10:01:33,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:33,357 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:01:33,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33 WrapperNode [2024-11-10 10:01:33,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:33,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:33,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:01:33,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:01:33,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,421 INFO L138 Inliner]: procedures = 30, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2024-11-10 10:01:33,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:33,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:01:33,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:01:33,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:01:33,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,450 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:01:33,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:01:33,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:01:33,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:01:33,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:01:33,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (1/1) ... [2024-11-10 10:01:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:33,532 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 10:01:33,537 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 10:01:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:01:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:01:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:01:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:01:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:01:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:01:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:01:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:01:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:01:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:01:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:01:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:01:33,724 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:01:33,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:01:34,226 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~ite66#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem65#1;havoc property_#t~mem64#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~short76#1;havoc property_#t~mem77#1;havoc property_#t~ite93#1;havoc property_#t~mem83#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~ite108#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1; [2024-11-10 10:01:34,280 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-10 10:01:34,280 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:01:34,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:01:34,301 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:01:34,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:34 BoogieIcfgContainer [2024-11-10 10:01:34,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:01:34,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:01:34,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:01:34,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:01:34,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:33" (1/3) ... [2024-11-10 10:01:34,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54229f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:34, skipping insertion in model container [2024-11-10 10:01:34,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:33" (2/3) ... [2024-11-10 10:01:34,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54229f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:34, skipping insertion in model container [2024-11-10 10:01:34,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:34" (3/3) ... [2024-11-10 10:01:34,314 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2024-11-10 10:01:34,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:01:34,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:01:34,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:01:34,395 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;@65f21f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:01:34,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:01:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:01:34,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:34,415 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:34,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -298942584, now seen corresponding path program 1 times [2024-11-10 10:01:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:34,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624469428] [2024-11-10 10:01:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:34,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624469428] [2024-11-10 10:01:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624469428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:01:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424718975] [2024-11-10 10:01:34,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:34,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:01:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:01:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:01:34,997 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:35,030 INFO L93 Difference]: Finished difference Result 198 states and 306 transitions. [2024-11-10 10:01:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:01:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-11-10 10:01:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:35,039 INFO L225 Difference]: With dead ends: 198 [2024-11-10 10:01:35,039 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 10:01:35,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 10:01:35,048 INFO L432 NwaCegarLoop]: 135 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, 135 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 10:01:35,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 10:01:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 10:01:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-11-10 10:01:35,101 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 121 [2024-11-10 10:01:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:35,102 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-11-10 10:01:35,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-11-10 10:01:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:01:35,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:35,106 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:01:35,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash -408993980, now seen corresponding path program 1 times [2024-11-10 10:01:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698630533] [2024-11-10 10:01:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698630533] [2024-11-10 10:01:35,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698630533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:35,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:01:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885925569] [2024-11-10 10:01:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:01:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:01:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:35,543 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:35,576 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2024-11-10 10:01:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:01:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-10 10:01:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:35,579 INFO L225 Difference]: With dead ends: 189 [2024-11-10 10:01:35,579 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 10:01:35,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:35,583 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:35,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 10:01:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 10:01:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-10 10:01:35,602 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 121 [2024-11-10 10:01:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:35,606 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-10 10:01:35,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-10 10:01:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 10:01:35,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:35,608 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:35,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:01:35,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 233296754, now seen corresponding path program 1 times [2024-11-10 10:01:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14588612] [2024-11-10 10:01:35,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14588612] [2024-11-10 10:01:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14588612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:01:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41441310] [2024-11-10 10:01:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:36,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:01:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:01:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:36,209 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:36,257 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2024-11-10 10:01:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:01:36,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-10 10:01:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:36,260 INFO L225 Difference]: With dead ends: 189 [2024-11-10 10:01:36,260 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 10:01:36,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:36,265 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:36,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 10:01:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 10:01:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-10 10:01:36,283 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 122 [2024-11-10 10:01:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:36,284 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-10 10:01:36,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-10 10:01:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 10:01:36,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:36,286 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:36,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:01:36,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:36,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1804759535, now seen corresponding path program 1 times [2024-11-10 10:01:36,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926118116] [2024-11-10 10:01:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:39,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926118116] [2024-11-10 10:01:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926118116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:39,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 10:01:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988903392] [2024-11-10 10:01:39,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:39,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:01:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:01:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:01:39,831 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:40,962 INFO L93 Difference]: Finished difference Result 235 states and 325 transitions. [2024-11-10 10:01:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:01:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 122 [2024-11-10 10:01:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:40,964 INFO L225 Difference]: With dead ends: 235 [2024-11-10 10:01:40,964 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 10:01:40,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-10 10:01:40,966 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 528 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:40,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 553 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 10:01:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 10:01:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 106. [2024-11-10 10:01:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-10 10:01:40,981 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 122 [2024-11-10 10:01:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:40,982 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-10 10:01:40,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-10 10:01:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:40,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:40,984 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:40,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:01:40,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash 999055635, now seen corresponding path program 1 times [2024-11-10 10:01:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500214508] [2024-11-10 10:01:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500214508] [2024-11-10 10:01:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500214508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:41,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:01:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183875526] [2024-11-10 10:01:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:41,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:01:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:41,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:01:41,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:01:41,459 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:41,745 INFO L93 Difference]: Finished difference Result 212 states and 294 transitions. [2024-11-10 10:01:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-10 10:01:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:41,747 INFO L225 Difference]: With dead ends: 212 [2024-11-10 10:01:41,747 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 10:01:41,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:41,749 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 109 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:41,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 340 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 10:01:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 10:01:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-10 10:01:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-10 10:01:41,766 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 124 [2024-11-10 10:01:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-10 10:01:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-10 10:01:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:41,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:41,771 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:01:41,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 311334970, now seen corresponding path program 1 times [2024-11-10 10:01:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281708188] [2024-11-10 10:01:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281708188] [2024-11-10 10:01:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281708188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:01:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198043839] [2024-11-10 10:01:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:41,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:01:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:01:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:41,928 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:41,944 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2024-11-10 10:01:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:01:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-10 10:01:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:41,946 INFO L225 Difference]: With dead ends: 209 [2024-11-10 10:01:41,946 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 10:01:41,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:41,948 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:41,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 10:01:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 10:01:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2024-11-10 10:01:41,960 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 124 [2024-11-10 10:01:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2024-11-10 10:01:41,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2024-11-10 10:01:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 10:01:41,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:41,963 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:01:41,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 635844757, now seen corresponding path program 1 times [2024-11-10 10:01:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63343514] [2024-11-10 10:01:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63343514] [2024-11-10 10:01:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63343514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:01:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541886287] [2024-11-10 10:01:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:01:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:01:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:01:43,997 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:45,086 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2024-11-10 10:01:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:01:45,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 126 [2024-11-10 10:01:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:45,088 INFO L225 Difference]: With dead ends: 247 [2024-11-10 10:01:45,088 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 10:01:45,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-11-10 10:01:45,090 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 199 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:45,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 513 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 10:01:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 10:01:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2024-11-10 10:01:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2024-11-10 10:01:45,104 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 126 [2024-11-10 10:01:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:45,104 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2024-11-10 10:01:45,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2024-11-10 10:01:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 10:01:45,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:45,105 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:01:45,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1045604364, now seen corresponding path program 1 times [2024-11-10 10:01:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661345030] [2024-11-10 10:01:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:45,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661345030] [2024-11-10 10:01:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661345030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:45,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:01:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560916187] [2024-11-10 10:01:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:45,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:01:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:01:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:45,318 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:45,355 INFO L93 Difference]: Finished difference Result 215 states and 292 transitions. [2024-11-10 10:01:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-10 10:01:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:45,357 INFO L225 Difference]: With dead ends: 215 [2024-11-10 10:01:45,357 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 10:01:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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 10:01:45,359 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 10:01:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 10:01:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2024-11-10 10:01:45,379 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 126 [2024-11-10 10:01:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:45,380 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2024-11-10 10:01:45,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2024-11-10 10:01:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 10:01:45,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:45,383 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:45,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:01:45,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -230463465, now seen corresponding path program 1 times [2024-11-10 10:01:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970394205] [2024-11-10 10:01:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970394205] [2024-11-10 10:01:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970394205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410835986] [2024-11-10 10:01:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:45,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:45,680 INFO L87 Difference]: Start difference. First operand 111 states and 149 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:45,826 INFO L93 Difference]: Finished difference Result 228 states and 306 transitions. [2024-11-10 10:01:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:01:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-10 10:01:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:45,828 INFO L225 Difference]: With dead ends: 228 [2024-11-10 10:01:45,828 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 10:01:45,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 10:01:45,830 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:45,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 335 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:01:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 10:01:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-10 10:01:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-11-10 10:01:45,843 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 128 [2024-11-10 10:01:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:45,844 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-11-10 10:01:45,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-11-10 10:01:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 10:01:45,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:45,845 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:01:45,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:45,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1277088344, now seen corresponding path program 1 times [2024-11-10 10:01:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958004504] [2024-11-10 10:01:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958004504] [2024-11-10 10:01:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958004504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 10:01:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182283722] [2024-11-10 10:01:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:49,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 10:01:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 10:01:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-10 10:01:49,130 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:50,262 INFO L93 Difference]: Finished difference Result 229 states and 305 transitions. [2024-11-10 10:01:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:01:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2024-11-10 10:01:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:50,265 INFO L225 Difference]: With dead ends: 229 [2024-11-10 10:01:50,265 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 10:01:50,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-10 10:01:50,266 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 327 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:50,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 404 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 10:01:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-11-10 10:01:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2024-11-10 10:01:50,280 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 142 transitions. Word has length 128 [2024-11-10 10:01:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 142 transitions. [2024-11-10 10:01:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 10:01:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 142 transitions. [2024-11-10 10:01:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 10:01:50,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:50,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:50,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:01:50,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:50,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash -578630633, now seen corresponding path program 1 times [2024-11-10 10:01:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:50,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701424971] [2024-11-10 10:01:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701424971] [2024-11-10 10:01:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701424971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:01:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953678674] [2024-11-10 10:01:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:50,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:01:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:01:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:50,705 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:51,138 INFO L93 Difference]: Finished difference Result 248 states and 329 transitions. [2024-11-10 10:01:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-10 10:01:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:51,140 INFO L225 Difference]: With dead ends: 248 [2024-11-10 10:01:51,140 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 10:01:51,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:01:51,141 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 304 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:51,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 313 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:01:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 10:01:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2024-11-10 10:01:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 153 transitions. [2024-11-10 10:01:51,151 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 153 transitions. Word has length 128 [2024-11-10 10:01:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:51,151 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 153 transitions. [2024-11-10 10:01:51,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 153 transitions. [2024-11-10 10:01:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 10:01:51,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:51,152 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:51,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:01:51,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2130536609, now seen corresponding path program 1 times [2024-11-10 10:01:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875018366] [2024-11-10 10:01:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:01:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 10:01:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:01:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:01:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 10:01:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 10:01:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875018366] [2024-11-10 10:01:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875018366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:01:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807021473] [2024-11-10 10:01:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:01:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:53,275 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 10:01:53,276 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 10:01:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:53,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 10:01:53,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:55,152 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 8 treesize of output 1 [2024-11-10 10:01:55,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2024-11-10 10:01:55,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:55,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-10 10:01:55,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:55,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-10 10:01:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:55,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:55,575 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-10 10:01:55,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 62 [2024-11-10 10:01:56,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:56,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:56,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:56,214 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-10 10:01:56,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 170 [2024-11-10 10:01:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 10:01:56,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:02:03,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 528422 treesize of output 483186 [2024-11-10 10:02:05,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63302 treesize of output 58144