./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.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-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:00:03,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:00:03,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:00:03,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:00:03,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:00:03,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:00:03,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:00:03,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:00:03,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:00:03,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:00:03,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:00:03,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:00:03,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:00:03,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:00:03,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:00:03,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:00:03,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:00:03,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:00:03,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:00:03,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:00:03,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:00:03,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:00:03,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:00:03,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:00:03,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:00:03,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:00:03,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:00:03,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:00:03,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:00:03,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:00:03,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:00:03,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:00:03,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:00:03,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:00:03,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:00:03,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:00:03,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:00:03,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:00:03,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:00:03,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:00:03,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:00:03,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:00:03,529 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2024-11-10 10:00:03,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:00:03,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:00:03,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:00:03,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:00:03,822 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:00:03,823 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-63.i [2024-11-10 10:00:05,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:00:05,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:00:05,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-10 10:00:05,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e66f310/4cad011f9e49478095786523d67d2ef5/FLAGfc3ca1598 [2024-11-10 10:00:05,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e66f310/4cad011f9e49478095786523d67d2ef5 [2024-11-10 10:00:05,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:00:05,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:00:05,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:00:05,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:00:05,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:00:05,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:05,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32137819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05, skipping insertion in model container [2024-11-10 10:00:05,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:05,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:00:05,747 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-63.i[917,930] [2024-11-10 10:00:05,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:00:05,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:00:05,876 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-63.i[917,930] [2024-11-10 10:00:05,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:00:05,963 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:00:05,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05 WrapperNode [2024-11-10 10:00:05,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:00:05,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:00:05,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:00:05,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:00:05,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:05,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,039 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 678 [2024-11-10 10:00:06,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:00:06,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:00:06,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:00:06,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:00:06,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,067 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:00:06,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:00:06,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:00:06,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:00:06,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:00:06,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (1/1) ... [2024-11-10 10:00:06,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:00:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:00:06,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:00:06,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:00:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:00:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:00:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:00:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:00:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:00:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:00:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:00:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:00:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:00:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:00:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:00:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:00:06,322 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:00:06,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:00:06,970 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2024-11-10 10:00:07,057 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-10 10:00:07,058 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:00:07,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:00:07,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:00:07,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:00:07 BoogieIcfgContainer [2024-11-10 10:00:07,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:00:07,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:00:07,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:00:07,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:00:07,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:00:05" (1/3) ... [2024-11-10 10:00:07,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1850818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:00:07, skipping insertion in model container [2024-11-10 10:00:07,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:05" (2/3) ... [2024-11-10 10:00:07,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1850818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:00:07, skipping insertion in model container [2024-11-10 10:00:07,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:00:07" (3/3) ... [2024-11-10 10:00:07,086 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-10 10:00:07,100 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:00:07,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:00:07,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:00:07,169 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;@5714d089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:00:07,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:00:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 121 states have (on average 1.421487603305785) internal successors, (172), 122 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 10:00:07,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:07,189 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:07,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:07,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1291043502, now seen corresponding path program 1 times [2024-11-10 10:00:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265902547] [2024-11-10 10:00:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265902547] [2024-11-10 10:00:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265902547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:00:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171463783] [2024-11-10 10:00:07,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:07,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:00:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:07,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:00:07,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:00:07,892 INFO L87 Difference]: Start difference. First operand has 142 states, 121 states have (on average 1.421487603305785) internal successors, (172), 122 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 10:00:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:07,930 INFO L93 Difference]: Finished difference Result 276 states and 427 transitions. [2024-11-10 10:00:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:00:07,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2024-11-10 10:00:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:07,940 INFO L225 Difference]: With dead ends: 276 [2024-11-10 10:00:07,940 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 10:00:07,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:00:07,947 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:07,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 10:00:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-10 10:00:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-10 10:00:08,000 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 158 [2024-11-10 10:00:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-10 10:00:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 10:00:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-10 10:00:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 10:00:08,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:08,008 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:08,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:00:08,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:08,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash -637406428, now seen corresponding path program 1 times [2024-11-10 10:00:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971598414] [2024-11-10 10:00:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:08,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971598414] [2024-11-10 10:00:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971598414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163026577] [2024-11-10 10:00:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:08,517 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 10:00:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:08,573 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-10 10:00:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2024-11-10 10:00:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:08,577 INFO L225 Difference]: With dead ends: 273 [2024-11-10 10:00:08,577 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 10:00:08,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 10:00:08,582 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:08,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 10:00:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-10 10:00:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-10 10:00:08,601 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2024-11-10 10:00:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-10 10:00:08,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 10:00:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-10 10:00:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 10:00:08,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:08,608 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:08,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:00:08,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:08,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1976169851, now seen corresponding path program 1 times [2024-11-10 10:00:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391536196] [2024-11-10 10:00:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391536196] [2024-11-10 10:00:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391536196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:08,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232503975] [2024-11-10 10:00:08,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:08,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:08,990 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:09,030 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2024-11-10 10:00:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-10 10:00:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:09,035 INFO L225 Difference]: With dead ends: 277 [2024-11-10 10:00:09,035 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 10:00:09,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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 10:00:09,041 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:09,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 10:00:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-10 10:00:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-10 10:00:09,058 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-10 10:00:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-10 10:00:09,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-10 10:00:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 10:00:09,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:09,066 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:09,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:00:09,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1776179801, now seen corresponding path program 1 times [2024-11-10 10:00:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888868214] [2024-11-10 10:00:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888868214] [2024-11-10 10:00:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888868214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:09,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916422742] [2024-11-10 10:00:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:09,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:09,340 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:09,386 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-10 10:00:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-10 10:00:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:09,389 INFO L225 Difference]: With dead ends: 282 [2024-11-10 10:00:09,389 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 10:00:09,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 10:00:09,395 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:09,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 580 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 10:00:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-10 10:00:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-10 10:00:09,409 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 160 [2024-11-10 10:00:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:09,409 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-10 10:00:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-10 10:00:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 10:00:09,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:09,412 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:09,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:00:09,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:09,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2013228870, now seen corresponding path program 1 times [2024-11-10 10:00:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320833043] [2024-11-10 10:00:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320833043] [2024-11-10 10:00:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320833043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564128487] [2024-11-10 10:00:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:09,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:09,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:09,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:09,645 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:09,699 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-10 10:00:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:09,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-10 10:00:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:09,704 INFO L225 Difference]: With dead ends: 286 [2024-11-10 10:00:09,704 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 10:00:09,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 10:00:09,707 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:09,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 580 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 10:00:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-10 10:00:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-10 10:00:09,724 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 160 [2024-11-10 10:00:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-10 10:00:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-10 10:00:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 10:00:09,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:09,728 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:09,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:00:09,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1816715365, now seen corresponding path program 1 times [2024-11-10 10:00:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955566533] [2024-11-10 10:00:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:00:09,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:09,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955566533] [2024-11-10 10:00:09,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955566533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:09,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:09,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281756647] [2024-11-10 10:00:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:09,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:09,952 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:09,981 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-10 10:00:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-10 10:00:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:09,983 INFO L225 Difference]: With dead ends: 290 [2024-11-10 10:00:09,983 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 10:00:09,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 10:00:09,986 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:09,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 581 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 10:00:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-10 10:00:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 10:00:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-10 10:00:10,002 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 160 [2024-11-10 10:00:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:10,002 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-10 10:00:10,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:00:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-10 10:00:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 10:00:10,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:10,008 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:10,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:00:10,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:10,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash -735441596, now seen corresponding path program 1 times [2024-11-10 10:00:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855357041] [2024-11-10 10:00:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:00:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:00:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:00:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:00:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:00:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:00:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:00:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:00:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:00:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:00:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 10:00:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855357041] [2024-11-10 10:00:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855357041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:00:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044219425] [2024-11-10 10:00:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:00:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:00:13,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:00:13,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:00:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:13,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-10 10:00:13,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:00:15,620 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 10:00:16,427 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 25 treesize of output 13 [2024-11-10 10:00:16,898 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 25 treesize of output 13 [2024-11-10 10:00:17,500 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 25 treesize of output 13 [2024-11-10 10:00:18,143 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 25 treesize of output 13 [2024-11-10 10:00:18,790 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 25 treesize of output 13 [2024-11-10 10:00:19,353 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 25 treesize of output 13 [2024-11-10 10:00:19,856 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 25 treesize of output 13 [2024-11-10 10:00:20,336 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-11-10 10:00:20,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 93 [2024-11-10 10:00:20,393 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 33 treesize of output 18 [2024-11-10 10:00:20,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-10 10:00:20,532 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 22 treesize of output 11 [2024-11-10 10:00:20,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,609 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2024-11-10 10:00:20,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 59 [2024-11-10 10:00:20,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:00:20,654 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 43 treesize of output 23 [2024-11-10 10:00:20,681 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2024-11-10 10:00:20,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 112 [2024-11-10 10:00:20,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,707 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2024-11-10 10:00:20,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 84 [2024-11-10 10:00:20,736 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-10 10:00:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2024-11-10 10:00:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 55 [2024-11-10 10:00:20,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2024-11-10 10:00:20,793 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:20,810 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2024-11-10 10:00:20,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 159 [2024-11-10 10:00:20,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 43 treesize of output 62 [2024-11-10 10:00:20,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2024-11-10 10:00:20,925 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:20,941 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2024-11-10 10:00:20,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 240 treesize of output 209 [2024-11-10 10:00:20,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:20,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2024-11-10 10:00:21,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2024-11-10 10:00:21,069 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,082 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-10 10:00:21,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2024-11-10 10:00:21,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 55 [2024-11-10 10:00:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2024-11-10 10:00:21,138 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,155 INFO L349 Elim1Store]: treesize reduction 202, result has 0.5 percent of original size [2024-11-10 10:00:21,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 250 [2024-11-10 10:00:21,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,207 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2024-11-10 10:00:21,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 219 [2024-11-10 10:00:21,266 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2024-11-10 10:00:21,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 472 treesize of output 293 [2024-11-10 10:00:21,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2024-11-10 10:00:21,340 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2024-11-10 10:00:21,454 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2024-11-10 10:00:21,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 448 treesize of output 284 [2024-11-10 10:00:21,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2024-11-10 10:00:21,517 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2024-11-10 10:00:21,596 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2024-11-10 10:00:21,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 159 [2024-11-10 10:00:21,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2024-11-10 10:00:21,640 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 43 treesize of output 62 [2024-11-10 10:00:21,695 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2024-11-10 10:00:21,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 228 treesize of output 200 [2024-11-10 10:00:21,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2024-11-10 10:00:21,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2024-11-10 10:00:21,820 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-10 10:00:21,831 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-10 10:00:21,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2024-11-10 10:00:21,844 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 20 treesize of output 16 [2024-11-10 10:00:21,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-10 10:00:21,876 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 20 treesize of output 16 [2024-11-10 10:00:21,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:21,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2024-11-10 10:00:22,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:22,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:22,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:22,183 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 10:00:22,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-10 10:00:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-10 10:00:22,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:01:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044219425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:01:09,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:01:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-11-10 10:01:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835585572] [2024-11-10 10:01:09,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 10:01:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 10:01:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 10:01:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=418, Unknown=11, NotChecked=0, Total=506 [2024-11-10 10:01:09,411 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-10 10:01:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:13,348 INFO L93 Difference]: Finished difference Result 534 states and 748 transitions. [2024-11-10 10:01:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 10:01:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 160 [2024-11-10 10:01:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:13,351 INFO L225 Difference]: With dead ends: 534 [2024-11-10 10:01:13,351 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 10:01:13,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=464, Invalid=1687, Unknown=11, NotChecked=0, Total=2162 [2024-11-10 10:01:13,353 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1007 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:13,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1076 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 10:01:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 10:01:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 254. [2024-11-10 10:01:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 226 states have (on average 1.3761061946902655) internal successors, (311), 227 states have internal predecessors, (311), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 10:01:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 357 transitions. [2024-11-10 10:01:13,373 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 357 transitions. Word has length 160 [2024-11-10 10:01:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:13,374 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 357 transitions. [2024-11-10 10:01:13,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-10 10:01:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 357 transitions. [2024-11-10 10:01:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 10:01:13,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:13,376 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:13,395 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 10:01:13,576 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 10:01:13,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:13,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1579913467, now seen corresponding path program 1 times [2024-11-10 10:01:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460718450] [2024-11-10 10:01:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:13,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:01:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:01:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:01:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460718450] [2024-11-10 10:01:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460718450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:01:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662052431] [2024-11-10 10:01:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:01:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:01:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:01:17,469 INFO L87 Difference]: Start difference. First operand 254 states and 357 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-10 10:01:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:18,322 INFO L93 Difference]: Finished difference Result 655 states and 921 transitions. [2024-11-10 10:01:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:01:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2024-11-10 10:01:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:18,326 INFO L225 Difference]: With dead ends: 655 [2024-11-10 10:01:18,326 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 10:01:18,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:01:18,327 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 373 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:18,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 792 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:01:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 10:01:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 393. [2024-11-10 10:01:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 344 states have (on average 1.369186046511628) internal successors, (471), 345 states have internal predecessors, (471), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 10:01:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 553 transitions. [2024-11-10 10:01:18,371 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 553 transitions. Word has length 160 [2024-11-10 10:01:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:18,371 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 553 transitions. [2024-11-10 10:01:18,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-10 10:01:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 553 transitions. [2024-11-10 10:01:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 10:01:18,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:18,373 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:18,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:01:18,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1259993630, now seen corresponding path program 1 times [2024-11-10 10:01:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372931873] [2024-11-10 10:01:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:01:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:01:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:01:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372931873] [2024-11-10 10:01:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372931873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:01:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302604809] [2024-11-10 10:01:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:01:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:01:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:01:20,104 INFO L87 Difference]: Start difference. First operand 393 states and 553 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:01:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:21,927 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2024-11-10 10:01:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:01:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 162 [2024-11-10 10:01:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:21,933 INFO L225 Difference]: With dead ends: 733 [2024-11-10 10:01:21,933 INFO L226 Difference]: Without dead ends: 482 [2024-11-10 10:01:21,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-10 10:01:21,937 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 466 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:21,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1068 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 10:01:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-10 10:01:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 416. [2024-11-10 10:01:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 367 states have (on average 1.3787465940054495) internal successors, (506), 368 states have internal predecessors, (506), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 10:01:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 588 transitions. [2024-11-10 10:01:21,983 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 588 transitions. Word has length 162 [2024-11-10 10:01:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:21,984 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 588 transitions. [2024-11-10 10:01:21,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 10:01:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 588 transitions. [2024-11-10 10:01:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 10:01:21,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:21,986 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:21,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:01:21,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2104465501, now seen corresponding path program 1 times [2024-11-10 10:01:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:21,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817092786] [2024-11-10 10:01:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 10:01:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 10:01:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817092786] [2024-11-10 10:01:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817092786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:01:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910469316] [2024-11-10 10:01:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:01:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:01:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:01:24,865 INFO L87 Difference]: Start difference. First operand 416 states and 588 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 10:01:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:26,249 INFO L93 Difference]: Finished difference Result 740 states and 1045 transitions. [2024-11-10 10:01:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2024-11-10 10:01:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:26,253 INFO L225 Difference]: With dead ends: 740 [2024-11-10 10:01:26,254 INFO L226 Difference]: Without dead ends: 466 [2024-11-10 10:01:26,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:01:26,256 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 663 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:26,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 624 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 10:01:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-10 10:01:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 416. [2024-11-10 10:01:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 368 states have internal predecessors, (505), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 10:01:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 587 transitions. [2024-11-10 10:01:26,307 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 587 transitions. Word has length 162 [2024-11-10 10:01:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 587 transitions. [2024-11-10 10:01:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 10:01:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 587 transitions. [2024-11-10 10:01:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 10:01:26,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:26,313 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:01:26,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1024869825, now seen corresponding path program 1 times [2024-11-10 10:01:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845883683] [2024-11-10 10:01:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat