./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.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-22.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 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:55:21,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:55:21,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:55:21,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:55:21,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:55:21,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:55:21,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:55:21,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:55:21,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:55:21,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:55:21,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:55:21,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:55:21,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:55:21,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:55:21,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:55:21,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:55:21,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:55:21,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:55:21,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:55:21,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:55:21,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:55:21,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:55:21,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:55:21,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:55:21,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:55:21,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:55:21,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:55:21,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:55:21,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:55:21,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:55:21,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:55:21,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:55:21,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:21,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:55:21,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:55:21,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:55:21,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:55:21,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:55:21,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:55:21,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:55:21,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:55:21,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:55:21,818 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 -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2024-11-10 09:55:22,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:55:22,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:55:22,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:55:22,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:55:22,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:55:22,146 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-22.i [2024-11-10 09:55:23,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:55:23,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:55:23,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-10 09:55:23,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22eda7329/5cf9a660cc7546a2959fa88e20d92c7c/FLAGc93888dbe [2024-11-10 09:55:23,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22eda7329/5cf9a660cc7546a2959fa88e20d92c7c [2024-11-10 09:55:23,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:55:23,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:55:23,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:23,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:55:23,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:55:23,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:23" (1/1) ... [2024-11-10 09:55:23,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ba0307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:23, skipping insertion in model container [2024-11-10 09:55:23,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:23" (1/1) ... [2024-11-10 09:55:23,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:55:24,140 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-22.i[917,930] [2024-11-10 09:55:24,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:24,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:55:24,266 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-22.i[917,930] [2024-11-10 09:55:24,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:24,355 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:55:24,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24 WrapperNode [2024-11-10 09:55:24,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:24,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:24,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:55:24,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:55:24,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,424 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-10 09:55:24,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:24,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:55:24,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:55:24,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:55:24,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,471 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:55:24,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:55:24,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:55:24,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:55:24,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:55:24,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (1/1) ... [2024-11-10 09:55:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:55:24,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:55:24,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:55:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:55:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:55:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:55:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:55:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:55:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:55:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:55:24,757 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:55:24,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:55:25,206 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem68#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem74#1;havoc property_#t~ite81#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~short82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~bitwise92#1;havoc property_#t~ite107#1;havoc property_#t~mem102#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2024-11-10 09:55:25,256 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-10 09:55:25,256 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:55:25,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:55:25,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:55:25,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:25 BoogieIcfgContainer [2024-11-10 09:55:25,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:55:25,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:55:25,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:55:25,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:55:25,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:23" (1/3) ... [2024-11-10 09:55:25,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d213680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:25, skipping insertion in model container [2024-11-10 09:55:25,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:24" (2/3) ... [2024-11-10 09:55:25,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d213680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:25, skipping insertion in model container [2024-11-10 09:55:25,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:25" (3/3) ... [2024-11-10 09:55:25,298 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-10 09:55:25,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:55:25,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:55:25,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:55:25,384 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;@297200f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:55:25,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:55:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:55:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 09:55:25,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:25,397 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:25,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 614637915, now seen corresponding path program 1 times [2024-11-10 09:55:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618502066] [2024-11-10 09:55:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618502066] [2024-11-10 09:55:25,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618502066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:25,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:25,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:55:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448464722] [2024-11-10 09:55:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:25,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:55:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:55:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:25,895 INFO L87 Difference]: Start difference. First operand has 108 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:55:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:25,929 INFO L93 Difference]: Finished difference Result 208 states and 316 transitions. [2024-11-10 09:55:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:55:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-10 09:55:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:25,938 INFO L225 Difference]: With dead ends: 208 [2024-11-10 09:55:25,938 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 09:55:25,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:25,946 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:25,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 09:55:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 09:55:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:55:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-10 09:55:26,052 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 92 [2024-11-10 09:55:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-10 09:55:26,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:55:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-10 09:55:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 09:55:26,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:26,058 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:55:26,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1369832762, now seen corresponding path program 1 times [2024-11-10 09:55:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130333429] [2024-11-10 09:55:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130333429] [2024-11-10 09:55:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130333429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:55:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24058787] [2024-11-10 09:55:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:55:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:55:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:26,407 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:55:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:26,465 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-11-10 09:55:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:55:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-10 09:55:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:26,468 INFO L225 Difference]: With dead ends: 205 [2024-11-10 09:55:26,468 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 09:55:26,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:26,470 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:26,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 09:55:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-10 09:55:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:55:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-10 09:55:26,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 92 [2024-11-10 09:55:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:26,490 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-10 09:55:26,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:55:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-10 09:55:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 09:55:26,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:26,496 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:26,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:55:26,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:26,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1900440613, now seen corresponding path program 1 times [2024-11-10 09:55:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411140795] [2024-11-10 09:55:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:28,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411140795] [2024-11-10 09:55:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411140795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:55:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279751442] [2024-11-10 09:55:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:28,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:55:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:55:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:55:28,153 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:28,865 INFO L93 Difference]: Finished difference Result 341 states and 494 transitions. [2024-11-10 09:55:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:55:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-10 09:55:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:28,873 INFO L225 Difference]: With dead ends: 341 [2024-11-10 09:55:28,873 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 09:55:28,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:55:28,876 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 214 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:28,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 358 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:55:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 09:55:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 155. [2024-11-10 09:55:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.373134328358209) internal successors, (184), 134 states have internal predecessors, (184), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2024-11-10 09:55:28,915 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 92 [2024-11-10 09:55:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2024-11-10 09:55:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2024-11-10 09:55:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:55:28,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:28,924 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:55:28,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:28,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 164791019, now seen corresponding path program 1 times [2024-11-10 09:55:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570633659] [2024-11-10 09:55:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570633659] [2024-11-10 09:55:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570633659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:55:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171979924] [2024-11-10 09:55:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:55:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:29,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:55:29,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:55:29,617 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:29,902 INFO L93 Difference]: Finished difference Result 341 states and 489 transitions. [2024-11-10 09:55:29,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:55:29,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-10 09:55:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:29,905 INFO L225 Difference]: With dead ends: 341 [2024-11-10 09:55:29,905 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 09:55:29,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:55:29,909 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 233 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:29,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 489 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:55:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 09:55:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 156. [2024-11-10 09:55:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2024-11-10 09:55:29,939 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 93 [2024-11-10 09:55:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2024-11-10 09:55:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2024-11-10 09:55:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 09:55:29,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:29,943 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:55:29,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:29,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1764798181, now seen corresponding path program 1 times [2024-11-10 09:55:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803408888] [2024-11-10 09:55:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:30,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803408888] [2024-11-10 09:55:30,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803408888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:55:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329059863] [2024-11-10 09:55:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:30,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:55:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:55:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:55:30,094 INFO L87 Difference]: Start difference. First operand 156 states and 221 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:30,178 INFO L93 Difference]: Finished difference Result 257 states and 366 transitions. [2024-11-10 09:55:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:55:30,178 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-10 09:55:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:30,180 INFO L225 Difference]: With dead ends: 257 [2024-11-10 09:55:30,180 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 09:55:30,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 09:55:30,181 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:30,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:55:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 09:55:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-10 09:55:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 134 states have internal predecessors, (182), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2024-11-10 09:55:30,202 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 94 [2024-11-10 09:55:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:30,203 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2024-11-10 09:55:30,203 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2024-11-10 09:55:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 09:55:30,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:30,206 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:30,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:55:30,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 157138698, now seen corresponding path program 1 times [2024-11-10 09:55:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151383677] [2024-11-10 09:55:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151383677] [2024-11-10 09:55:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151383677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:31,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:55:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557999698] [2024-11-10 09:55:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:55:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:31,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:55:31,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:55:31,351 INFO L87 Difference]: Start difference. First operand 155 states and 218 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:31,837 INFO L93 Difference]: Finished difference Result 346 states and 486 transitions. [2024-11-10 09:55:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:55:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-10 09:55:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:31,840 INFO L225 Difference]: With dead ends: 346 [2024-11-10 09:55:31,840 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 09:55:31,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:55:31,842 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 295 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:31,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 555 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:55:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 09:55:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 168. [2024-11-10 09:55:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.346938775510204) internal successors, (198), 147 states have internal predecessors, (198), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 234 transitions. [2024-11-10 09:55:31,862 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 234 transitions. Word has length 97 [2024-11-10 09:55:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:31,866 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 234 transitions. [2024-11-10 09:55:31,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 234 transitions. [2024-11-10 09:55:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 09:55:31,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:31,868 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:31,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:55:31,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:31,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 662697323, now seen corresponding path program 1 times [2024-11-10 09:55:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620060413] [2024-11-10 09:55:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:31,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-10 09:55:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620060413] [2024-11-10 09:55:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620060413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:55:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73503659] [2024-11-10 09:55:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:33,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:55:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:55:33,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:55:33,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:55:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:33,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 09:55:33,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:55:33,890 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 55 treesize of output 54 [2024-11-10 09:55:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2024-11-10 09:55:36,822 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 11 treesize of output 9 [2024-11-10 09:55:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:36,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 22 [2024-11-10 09:55:37,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 09:55:37,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:55:37,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 09:55:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-10 09:55:37,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:55:37,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_552 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_552))) (let ((.cse1 (mod (+ 65520 (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (not (= v_ArrVal_552 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_552 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (< 32767 .cse1))))) (forall ((v_ArrVal_552 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_552))) (let ((.cse3 (mod (+ 65520 (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (not (= v_ArrVal_552 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_552 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< .cse3 32768) (= .cse3 (+ 65536 (select (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))))))) is different from false [2024-11-10 09:55:37,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((|ULTIMATE.start_step_#t~ite23#1| Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_552))) (let ((.cse0 (mod (+ 65520 (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse0 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (not (= v_ArrVal_552 (store (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_552 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< 32767 .cse0)))))) (forall ((|ULTIMATE.start_step_#t~ite23#1| Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse6 (store .cse5 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_552))) (let ((.cse4 (mod (+ 65520 (select (select .cse6 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (< .cse4 32768) (not (= v_ArrVal_552 (store (select .cse5 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_552 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse4 (+ 65536 (select (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))))))))) is different from false [2024-11-10 09:55:38,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 09:55:38,914 INFO L349 Elim1Store]: treesize reduction 58, result has 50.0 percent of original size [2024-11-10 09:55:38,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 305 treesize of output 106 [2024-11-10 09:55:38,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:38,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 179 treesize of output 187 [2024-11-10 09:55:39,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2024-11-10 09:55:39,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:39,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2024-11-10 09:55:39,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-10 09:55:39,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:39,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 338 treesize of output 318 [2024-11-10 09:55:40,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 09:55:40,300 INFO L349 Elim1Store]: treesize reduction 67, result has 42.2 percent of original size [2024-11-10 09:55:40,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 303 treesize of output 95 [2024-11-10 09:55:40,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:40,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 162 treesize of output 170 [2024-11-10 09:55:40,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-10 09:55:40,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-10 09:55:40,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:40,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 228 [2024-11-10 09:55:41,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 09:55:41,199 INFO L349 Elim1Store]: treesize reduction 60, result has 50.0 percent of original size [2024-11-10 09:55:41,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 108 [2024-11-10 09:55:41,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:41,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 181 treesize of output 189 [2024-11-10 09:55:41,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2024-11-10 09:55:41,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2024-11-10 09:55:41,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 392 [2024-11-10 09:55:42,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 09:55:42,604 INFO L349 Elim1Store]: treesize reduction 89, result has 25.8 percent of original size [2024-11-10 09:55:42,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 77 [2024-11-10 09:55:42,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:55:42,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 130 [2024-11-10 09:55:42,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-10 09:55:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73503659] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:55:48,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:55:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 11] total 29 [2024-11-10 09:55:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092606065] [2024-11-10 09:55:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:48,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:55:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:55:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=621, Unknown=3, NotChecked=102, Total=812 [2024-11-10 09:55:48,140 INFO L87 Difference]: Start difference. First operand 168 states and 234 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:49,429 INFO L93 Difference]: Finished difference Result 338 states and 472 transitions. [2024-11-10 09:55:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:55:49,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-10 09:55:49,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:49,433 INFO L225 Difference]: With dead ends: 338 [2024-11-10 09:55:49,433 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 09:55:49,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=106, Invalid=769, Unknown=3, NotChecked=114, Total=992 [2024-11-10 09:55:49,435 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 352 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:49,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 479 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 433 Unchecked, 0.7s Time] [2024-11-10 09:55:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 09:55:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 198. [2024-11-10 09:55:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.344632768361582) internal successors, (238), 177 states have internal predecessors, (238), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2024-11-10 09:55:49,450 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 274 transitions. Word has length 97 [2024-11-10 09:55:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 274 transitions. [2024-11-10 09:55:49,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 274 transitions. [2024-11-10 09:55:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:55:49,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:49,453 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:49,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:55:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:55:49,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1383881085, now seen corresponding path program 1 times [2024-11-10 09:55:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221959270] [2024-11-10 09:55:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:50,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221959270] [2024-11-10 09:55:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221959270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:55:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958273785] [2024-11-10 09:55:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:55:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:55:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:55:50,453 INFO L87 Difference]: Start difference. First operand 198 states and 274 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:50,838 INFO L93 Difference]: Finished difference Result 391 states and 548 transitions. [2024-11-10 09:55:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:55:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-10 09:55:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:50,841 INFO L225 Difference]: With dead ends: 391 [2024-11-10 09:55:50,841 INFO L226 Difference]: Without dead ends: 256 [2024-11-10 09:55:50,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:55:50,842 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 203 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:50,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 516 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:55:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-10 09:55:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 181. [2024-11-10 09:55:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.35) internal successors, (216), 160 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2024-11-10 09:55:50,862 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 98 [2024-11-10 09:55:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2024-11-10 09:55:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2024-11-10 09:55:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:50,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:50,864 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:50,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:55:50,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1186335986, now seen corresponding path program 1 times [2024-11-10 09:55:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710547314] [2024-11-10 09:55:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:51,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710547314] [2024-11-10 09:55:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710547314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:51,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:55:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436424511] [2024-11-10 09:55:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:51,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:55:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:55:51,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:55:51,438 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:52,390 INFO L93 Difference]: Finished difference Result 398 states and 562 transitions. [2024-11-10 09:55:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:55:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-10 09:55:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:52,392 INFO L225 Difference]: With dead ends: 398 [2024-11-10 09:55:52,392 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 09:55:52,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:55:52,393 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 168 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:52,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 475 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:55:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 09:55:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 192. [2024-11-10 09:55:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2024-11-10 09:55:52,410 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 99 [2024-11-10 09:55:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2024-11-10 09:55:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2024-11-10 09:55:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:52,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:52,412 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:55:52,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -224721969, now seen corresponding path program 1 times [2024-11-10 09:55:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048647907] [2024-11-10 09:55:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048647907] [2024-11-10 09:55:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048647907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:55:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004171782] [2024-11-10 09:55:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:55:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:55:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:55:53,374 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:55:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:54,046 INFO L93 Difference]: Finished difference Result 327 states and 458 transitions. [2024-11-10 09:55:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:55:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2024-11-10 09:55:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:54,048 INFO L225 Difference]: With dead ends: 327 [2024-11-10 09:55:54,048 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 09:55:54,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:55:54,049 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:54,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 478 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:55:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 09:55:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 195. [2024-11-10 09:55:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.339080459770115) internal successors, (233), 174 states have internal predecessors, (233), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2024-11-10 09:55:54,065 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 99 [2024-11-10 09:55:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:54,066 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2024-11-10 09:55:54,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:55:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2024-11-10 09:55:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:54,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:54,067 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:55:54,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1020042512, now seen corresponding path program 1 times [2024-11-10 09:55:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103691276] [2024-11-10 09:55:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103691276] [2024-11-10 09:55:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103691276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:55:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152325652] [2024-11-10 09:55:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:55:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:55:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:55:55,236 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:55:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:55,600 INFO L93 Difference]: Finished difference Result 333 states and 465 transitions. [2024-11-10 09:55:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:55:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2024-11-10 09:55:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:55,602 INFO L225 Difference]: With dead ends: 333 [2024-11-10 09:55:55,602 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 09:55:55,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:55:55,603 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:55,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 519 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:55:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 09:55:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-10 09:55:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 191 states have (on average 1.3403141361256545) internal successors, (256), 191 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 292 transitions. [2024-11-10 09:55:55,619 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 292 transitions. Word has length 99 [2024-11-10 09:55:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:55,619 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 292 transitions. [2024-11-10 09:55:55,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:55:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 292 transitions. [2024-11-10 09:55:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:55,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:55,620 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:55,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:55:55,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:55,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1525601137, now seen corresponding path program 1 times [2024-11-10 09:55:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231326447] [2024-11-10 09:55:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231326447] [2024-11-10 09:55:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231326447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:56,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:55:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067974519] [2024-11-10 09:55:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:56,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:55:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:55:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:55:56,179 INFO L87 Difference]: Start difference. First operand 212 states and 292 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:56,881 INFO L93 Difference]: Finished difference Result 388 states and 540 transitions. [2024-11-10 09:55:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:55:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-10 09:55:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:56,884 INFO L225 Difference]: With dead ends: 388 [2024-11-10 09:55:56,884 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 09:55:56,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:55:56,885 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 136 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:56,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 441 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:55:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 09:55:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 194. [2024-11-10 09:55:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2024-11-10 09:55:56,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 99 [2024-11-10 09:55:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2024-11-10 09:55:56,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2024-11-10 09:55:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:56,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:56,904 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:56,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:55:56,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:56,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1562376621, now seen corresponding path program 1 times [2024-11-10 09:55:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783605513] [2024-11-10 09:55:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783605513] [2024-11-10 09:55:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783605513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:58,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:55:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998414637] [2024-11-10 09:55:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:55:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:55:58,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:55:58,322 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:59,360 INFO L93 Difference]: Finished difference Result 415 states and 576 transitions. [2024-11-10 09:55:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:55:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-10 09:55:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:59,362 INFO L225 Difference]: With dead ends: 415 [2024-11-10 09:55:59,362 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 09:55:59,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:55:59,363 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 341 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:59,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 846 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:55:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 09:55:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 206. [2024-11-10 09:55:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.335135135135135) internal successors, (247), 185 states have internal predecessors, (247), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2024-11-10 09:55:59,388 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 99 [2024-11-10 09:55:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:59,388 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2024-11-10 09:55:59,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2024-11-10 09:55:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:55:59,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:59,389 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:55:59,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:59,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 716451816, now seen corresponding path program 1 times [2024-11-10 09:55:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247474181] [2024-11-10 09:55:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:55:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:55:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:55:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:55:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:55:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:55:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:55:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:59,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247474181] [2024-11-10 09:55:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247474181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:55:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029631448] [2024-11-10 09:55:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:55:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:55:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:55:59,642 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:59,667 INFO L93 Difference]: Finished difference Result 329 states and 457 transitions. [2024-11-10 09:55:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:55:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-10 09:55:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:59,669 INFO L225 Difference]: With dead ends: 329 [2024-11-10 09:55:59,669 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 09:55:59,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 09:55:59,670 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:59,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 09:55:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-10 09:55:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.312849162011173) internal successors, (235), 179 states have internal predecessors, (235), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:55:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2024-11-10 09:55:59,686 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 99 [2024-11-10 09:55:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2024-11-10 09:55:59,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:55:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2024-11-10 09:55:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 09:55:59,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:59,689 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:55:59,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1029313479, now seen corresponding path program 1 times [2024-11-10 09:55:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331474444] [2024-11-10 09:55:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:56:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:56:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:56:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:56:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:56:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331474444] [2024-11-10 09:56:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331474444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:01,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:01,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:56:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557329326] [2024-11-10 09:56:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:01,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:56:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:56:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:56:01,092 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:56:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:02,807 INFO L93 Difference]: Finished difference Result 417 states and 570 transitions. [2024-11-10 09:56:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:56:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-10 09:56:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:02,810 INFO L225 Difference]: With dead ends: 417 [2024-11-10 09:56:02,810 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 09:56:02,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:56:02,813 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 294 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:02,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 783 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 09:56:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 09:56:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 212. [2024-11-10 09:56:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 191 states have (on average 1.3193717277486912) internal successors, (252), 191 states have internal predecessors, (252), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:56:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 288 transitions. [2024-11-10 09:56:02,841 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 288 transitions. Word has length 100 [2024-11-10 09:56:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:02,842 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 288 transitions. [2024-11-10 09:56:02,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:56:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 288 transitions. [2024-11-10 09:56:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 09:56:02,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:02,843 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:02,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:56:02,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash -518779302, now seen corresponding path program 1 times [2024-11-10 09:56:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829877637] [2024-11-10 09:56:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:56:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:56:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:56:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:56:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829877637] [2024-11-10 09:56:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829877637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:56:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132760327] [2024-11-10 09:56:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:56:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:56:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:56:04,579 INFO L87 Difference]: Start difference. First operand 212 states and 288 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:56:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:05,403 INFO L93 Difference]: Finished difference Result 400 states and 549 transitions. [2024-11-10 09:56:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:56:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2024-11-10 09:56:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:05,406 INFO L225 Difference]: With dead ends: 400 [2024-11-10 09:56:05,407 INFO L226 Difference]: Without dead ends: 281 [2024-11-10 09:56:05,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:56:05,408 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 182 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:05,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 595 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:56:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-10 09:56:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 247. [2024-11-10 09:56:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 states have internal predecessors, (300), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:56:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 336 transitions. [2024-11-10 09:56:05,448 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 336 transitions. Word has length 100 [2024-11-10 09:56:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:05,449 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 336 transitions. [2024-11-10 09:56:05,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-10 09:56:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 336 transitions. [2024-11-10 09:56:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 09:56:05,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:05,451 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:05,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:56:05,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:05,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1153076625, now seen corresponding path program 1 times [2024-11-10 09:56:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724296892] [2024-11-10 09:56:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:56:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:56:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:56:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:56:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-10 09:56:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724296892] [2024-11-10 09:56:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724296892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791766574] [2024-11-10 09:56:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:56:06,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:56:06,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:56:06,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:56:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:07,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 09:56:07,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:07,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-10 09:56:08,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:56:09,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:09,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 18 [2024-11-10 09:56:09,552 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 90 treesize of output 66 [2024-11-10 09:56:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:09,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:09,585 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2024-11-10 09:56:09,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 85 [2024-11-10 09:56:09,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:09,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2024-11-10 09:56:12,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:56:12,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 250 treesize of output 510