./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.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-s_file-40.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 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:46:59,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:46:59,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:46:59,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:46:59,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:46:59,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:46:59,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:46:59,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:46:59,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:46:59,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:46:59,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:46:59,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:46:59,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:46:59,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:46:59,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:46:59,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:46:59,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:46:59,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:46:59,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:46:59,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:46:59,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:46:59,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:46:59,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:46:59,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:46:59,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:46:59,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:46:59,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:46:59,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:46:59,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:46:59,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:46:59,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:46:59,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:46:59,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:46:59,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:46:59,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:46:59,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:46:59,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:46:59,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:46:59,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:46:59,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:46:59,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:46:59,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:46:59,799 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 -> 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f [2024-11-10 09:47:00,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:47:00,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:47:00,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:47:00,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:47:00,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:47:00,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2024-11-10 09:47:01,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:47:01,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:47:01,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2024-11-10 09:47:01,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11a5f099/5366710097ec4ffe9c66e51a1065cfaa/FLAG83a368753 [2024-11-10 09:47:01,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11a5f099/5366710097ec4ffe9c66e51a1065cfaa [2024-11-10 09:47:01,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:47:01,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:47:01,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:47:01,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:47:01,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:47:01,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:47:01" (1/1) ... [2024-11-10 09:47:01,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bbd993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:01, skipping insertion in model container [2024-11-10 09:47:01,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:47:01" (1/1) ... [2024-11-10 09:47:01,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:47:02,119 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-s_file-40.i[916,929] [2024-11-10 09:47:02,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:47:02,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:47:02,209 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-s_file-40.i[916,929] [2024-11-10 09:47:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:47:02,295 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:47:02,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02 WrapperNode [2024-11-10 09:47:02,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:47:02,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:47:02,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:47:02,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:47:02,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,373 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-10 09:47:02,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:47:02,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:47:02,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:47:02,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:47:02,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,400 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:47:02,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:47:02,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:47:02,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:47:02,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:47:02,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (1/1) ... [2024-11-10 09:47:02,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:47:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:47:02,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:47:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:47:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:47:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:47:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:47:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:47:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:47:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:47:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:47:02,640 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:47:02,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:47:03,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem70#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2024-11-10 09:47:03,192 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-10 09:47:03,192 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:47:03,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:47:03,209 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:47:03,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:47:03 BoogieIcfgContainer [2024-11-10 09:47:03,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:47:03,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:47:03,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:47:03,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:47:03,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:47:01" (1/3) ... [2024-11-10 09:47:03,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452c421c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:47:03, skipping insertion in model container [2024-11-10 09:47:03,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:47:02" (2/3) ... [2024-11-10 09:47:03,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452c421c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:47:03, skipping insertion in model container [2024-11-10 09:47:03,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:47:03" (3/3) ... [2024-11-10 09:47:03,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-40.i [2024-11-10 09:47:03,227 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:47:03,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:47:03,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:47:03,291 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;@c05c64d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:47:03,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:47:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:47:03,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:03,321 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:03,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1869384411, now seen corresponding path program 1 times [2024-11-10 09:47:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930468244] [2024-11-10 09:47:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930468244] [2024-11-10 09:47:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930468244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:03,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:03,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:47:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879670889] [2024-11-10 09:47:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:47:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:47:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:47:03,777 INFO L87 Difference]: Start difference. First operand has 116 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:47:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:03,807 INFO L93 Difference]: Finished difference Result 224 states and 352 transitions. [2024-11-10 09:47:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:47:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-10 09:47:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:03,817 INFO L225 Difference]: With dead ends: 224 [2024-11-10 09:47:03,817 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 09:47:03,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:47:03,822 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:03,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:47:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 09:47:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 09:47:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-10 09:47:03,854 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 152 [2024-11-10 09:47:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:03,855 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-10 09:47:03,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:47:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-10 09:47:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:47:03,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:03,858 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:47:03,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:03,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 805153692, now seen corresponding path program 1 times [2024-11-10 09:47:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215137826] [2024-11-10 09:47:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:03,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:04,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:04,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215137826] [2024-11-10 09:47:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215137826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:47:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534467662] [2024-11-10 09:47:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:47:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:47:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:04,408 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:04,456 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2024-11-10 09:47:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:47:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-10 09:47:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:04,464 INFO L225 Difference]: With dead ends: 221 [2024-11-10 09:47:04,464 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 09:47:04,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:04,467 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:04,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:47:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 09:47:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-10 09:47:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-10 09:47:04,489 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 152 [2024-11-10 09:47:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:04,491 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-10 09:47:04,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-10 09:47:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:47:04,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:04,496 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:47:04,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:04,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1775964051, now seen corresponding path program 1 times [2024-11-10 09:47:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841838431] [2024-11-10 09:47:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841838431] [2024-11-10 09:47:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841838431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:04,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:47:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911237497] [2024-11-10 09:47:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:47:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:47:04,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:47:04,892 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:04,938 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-10 09:47:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:47:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:47:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:04,942 INFO L225 Difference]: With dead ends: 226 [2024-11-10 09:47:04,942 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:47:04,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:47:04,943 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:04,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:47:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:47:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-10 09:47:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-10 09:47:04,957 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 155 [2024-11-10 09:47:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:04,959 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-10 09:47:04,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-10 09:47:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:47:04,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:04,964 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:04,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:47:04,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:04,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1269225412, now seen corresponding path program 1 times [2024-11-10 09:47:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209436505] [2024-11-10 09:47:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:04,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209436505] [2024-11-10 09:47:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209436505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:47:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282241145] [2024-11-10 09:47:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:47:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:47:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:05,139 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:05,172 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2024-11-10 09:47:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:47:05,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:47:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:05,174 INFO L225 Difference]: With dead ends: 228 [2024-11-10 09:47:05,174 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 09:47:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:05,177 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:47:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 09:47:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-10 09:47:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-10 09:47:05,183 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 155 [2024-11-10 09:47:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-10 09:47:05,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-10 09:47:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:47:05,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:05,185 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:05,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:47:05,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:05,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1465738917, now seen corresponding path program 1 times [2024-11-10 09:47:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614833624] [2024-11-10 09:47:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614833624] [2024-11-10 09:47:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614833624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:47:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522328623] [2024-11-10 09:47:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:47:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:47:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:05,383 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:05,409 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2024-11-10 09:47:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:47:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:47:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:05,411 INFO L225 Difference]: With dead ends: 232 [2024-11-10 09:47:05,411 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 09:47:05,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:47:05,412 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:05,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:47:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 09:47:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-10 09:47:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:47:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2024-11-10 09:47:05,425 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 155 [2024-11-10 09:47:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:05,425 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2024-11-10 09:47:05,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:47:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-10 09:47:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:47:05,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:05,430 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:47:05,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash 277071418, now seen corresponding path program 1 times [2024-11-10 09:47:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956868595] [2024-11-10 09:47:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:47:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956868595] [2024-11-10 09:47:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956868595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:47:07,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:47:07,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:47:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146429786] [2024-11-10 09:47:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:47:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:47:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:47:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:47:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:47:07,676 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 09:47:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:47:08,210 INFO L93 Difference]: Finished difference Result 313 states and 445 transitions. [2024-11-10 09:47:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:47:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-10 09:47:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:47:08,212 INFO L225 Difference]: With dead ends: 313 [2024-11-10 09:47:08,212 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 09:47:08,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:47:08,213 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 89 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:47:08,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 913 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:47:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 09:47:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2024-11-10 09:47:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 163 states have internal predecessors, (217), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 09:47:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 275 transitions. [2024-11-10 09:47:08,222 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 275 transitions. Word has length 155 [2024-11-10 09:47:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:47:08,223 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 275 transitions. [2024-11-10 09:47:08,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 09:47:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 275 transitions. [2024-11-10 09:47:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:47:08,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:47:08,224 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:47:08,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:47:08,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:47:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:47:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1630381115, now seen corresponding path program 1 times [2024-11-10 09:47:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:47:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751520489] [2024-11-10 09:47:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:47:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:47:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:47:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:47:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:47:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:47:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:47:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:47:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:47:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:47:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:47:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:47:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:47:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:47:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:47:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:47:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:47:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:47:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:47:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:47:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 09:47:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:47:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751520489] [2024-11-10 09:47:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751520489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:47:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915016917] [2024-11-10 09:47:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:47:16,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:47:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:47:16,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:47:16,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:47:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:47:16,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 09:47:16,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:47:17,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:47:17,260 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 24 treesize of output 12 [2024-11-10 09:47:17,297 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 24 treesize of output 12 [2024-11-10 09:47:17,333 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 24 treesize of output 12 [2024-11-10 09:47:17,363 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 24 treesize of output 12 [2024-11-10 09:47:17,400 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 24 treesize of output 12 [2024-11-10 09:47:17,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:47:17,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 26 [2024-11-10 09:47:18,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:47:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1709 treesize of output 825 [2024-11-10 09:47:21,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:47:21,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 413 treesize of output 219 [2024-11-10 09:47:23,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:47:23,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 426 treesize of output 182 [2024-11-10 09:47:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-10 09:47:27,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:48:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915016917] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:48:01,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:48:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13, 12] total 29 [2024-11-10 09:48:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108759958] [2024-11-10 09:48:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:01,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:48:01,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:01,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:48:01,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-11-10 09:48:01,291 INFO L87 Difference]: Start difference. First operand 194 states and 275 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:10,518 INFO L93 Difference]: Finished difference Result 470 states and 660 transitions. [2024-11-10 09:48:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:48:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:48:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:10,523 INFO L225 Difference]: With dead ends: 470 [2024-11-10 09:48:10,523 INFO L226 Difference]: Without dead ends: 279 [2024-11-10 09:48:10,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2024-11-10 09:48:10,524 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 213 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:10,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 625 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-10 09:48:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-10 09:48:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2024-11-10 09:48:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 232 states have (on average 1.331896551724138) internal successors, (309), 235 states have internal predecessors, (309), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 09:48:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2024-11-10 09:48:10,542 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 155 [2024-11-10 09:48:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:10,543 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2024-11-10 09:48:10,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2024-11-10 09:48:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:48:10,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:10,544 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:10,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:48:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:48:10,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:10,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 308091225, now seen corresponding path program 1 times [2024-11-10 09:48:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137766443] [2024-11-10 09:48:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137766443] [2024-11-10 09:48:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137766443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:48:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808320944] [2024-11-10 09:48:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:17,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:48:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:17,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:48:17,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:48:17,610 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:48:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:25,603 INFO L93 Difference]: Finished difference Result 854 states and 1199 transitions. [2024-11-10 09:48:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:48:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 09:48:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:25,610 INFO L225 Difference]: With dead ends: 854 [2024-11-10 09:48:25,610 INFO L226 Difference]: Without dead ends: 597 [2024-11-10 09:48:25,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:48:25,612 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 200 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:25,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 764 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-10 09:48:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-10 09:48:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 574. [2024-11-10 09:48:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 496 states have (on average 1.3487903225806452) internal successors, (669), 501 states have internal predecessors, (669), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 09:48:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 809 transitions. [2024-11-10 09:48:25,682 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 809 transitions. Word has length 155 [2024-11-10 09:48:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 809 transitions. [2024-11-10 09:48:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:48:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 809 transitions. [2024-11-10 09:48:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:48:25,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:25,684 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:48:25,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:25,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1661400922, now seen corresponding path program 1 times [2024-11-10 09:48:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899126314] [2024-11-10 09:48:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899126314] [2024-11-10 09:48:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899126314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:48:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878543671] [2024-11-10 09:48:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:48:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:48:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:48:26,482 INFO L87 Difference]: Start difference. First operand 574 states and 809 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:48:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:26,995 INFO L93 Difference]: Finished difference Result 1201 states and 1684 transitions. [2024-11-10 09:48:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:48:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 09:48:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:27,000 INFO L225 Difference]: With dead ends: 1201 [2024-11-10 09:48:27,000 INFO L226 Difference]: Without dead ends: 630 [2024-11-10 09:48:27,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:48:27,004 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 94 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:27,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1102 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:48:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-10 09:48:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 625. [2024-11-10 09:48:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 530 states have (on average 1.3264150943396227) internal successors, (703), 536 states have internal predecessors, (703), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:48:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 871 transitions. [2024-11-10 09:48:27,047 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 871 transitions. Word has length 155 [2024-11-10 09:48:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 871 transitions. [2024-11-10 09:48:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:48:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 871 transitions. [2024-11-10 09:48:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:48:27,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:27,053 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:48:27,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:27,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1579563391, now seen corresponding path program 1 times [2024-11-10 09:48:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865989956] [2024-11-10 09:48:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:27,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865989956] [2024-11-10 09:48:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865989956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:27,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:48:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237993475] [2024-11-10 09:48:27,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:27,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:48:27,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:48:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:48:27,851 INFO L87 Difference]: Start difference. First operand 625 states and 871 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:28,041 INFO L93 Difference]: Finished difference Result 1226 states and 1709 transitions. [2024-11-10 09:48:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:48:28,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-10 09:48:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:28,044 INFO L225 Difference]: With dead ends: 1226 [2024-11-10 09:48:28,044 INFO L226 Difference]: Without dead ends: 630 [2024-11-10 09:48:28,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:48:28,048 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 98 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:28,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 291 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:48:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-10 09:48:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 625. [2024-11-10 09:48:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 530 states have (on average 1.318867924528302) internal successors, (699), 536 states have internal predecessors, (699), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:48:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 867 transitions. [2024-11-10 09:48:28,084 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 867 transitions. Word has length 156 [2024-11-10 09:48:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:28,085 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 867 transitions. [2024-11-10 09:48:28,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 867 transitions. [2024-11-10 09:48:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:48:28,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:28,088 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:28,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:48:28,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:28,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash -118905493, now seen corresponding path program 1 times [2024-11-10 09:48:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208159032] [2024-11-10 09:48:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208159032] [2024-11-10 09:48:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208159032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:28,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:28,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:48:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151962303] [2024-11-10 09:48:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:28,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:48:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:48:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:48:28,222 INFO L87 Difference]: Start difference. First operand 625 states and 867 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:28,274 INFO L93 Difference]: Finished difference Result 1249 states and 1731 transitions. [2024-11-10 09:48:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:48:28,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-10 09:48:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:28,277 INFO L225 Difference]: With dead ends: 1249 [2024-11-10 09:48:28,277 INFO L226 Difference]: Without dead ends: 653 [2024-11-10 09:48:28,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:48:28,278 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:28,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 761 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:48:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-10 09:48:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 632. [2024-11-10 09:48:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 537 states have (on average 1.314711359404097) internal successors, (706), 543 states have internal predecessors, (706), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:48:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 874 transitions. [2024-11-10 09:48:28,310 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 874 transitions. Word has length 157 [2024-11-10 09:48:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 874 transitions. [2024-11-10 09:48:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 874 transitions. [2024-11-10 09:48:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:48:28,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:28,312 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:28,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:48:28,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1452101120, now seen corresponding path program 1 times [2024-11-10 09:48:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436163333] [2024-11-10 09:48:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436163333] [2024-11-10 09:48:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436163333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:48:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14851595] [2024-11-10 09:48:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:48:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:48:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:48:28,652 INFO L87 Difference]: Start difference. First operand 632 states and 874 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:29,219 INFO L93 Difference]: Finished difference Result 1421 states and 1964 transitions. [2024-11-10 09:48:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:48:29,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-10 09:48:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:29,225 INFO L225 Difference]: With dead ends: 1421 [2024-11-10 09:48:29,225 INFO L226 Difference]: Without dead ends: 818 [2024-11-10 09:48:29,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:48:29,228 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 122 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:29,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 626 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:48:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-10 09:48:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 718. [2024-11-10 09:48:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 596 states have internal predecessors, (763), 113 states have call successors, (113), 14 states have call predecessors, (113), 14 states have return successors, (113), 107 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-10 09:48:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 989 transitions. [2024-11-10 09:48:29,292 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 989 transitions. Word has length 157 [2024-11-10 09:48:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:48:29,293 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 989 transitions. [2024-11-10 09:48:29,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 989 transitions. [2024-11-10 09:48:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:48:29,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:48:29,294 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:48:29,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:48:29,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:48:29,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:48:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash -916647049, now seen corresponding path program 1 times [2024-11-10 09:48:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:48:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419277751] [2024-11-10 09:48:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:48:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:48:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:48:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:48:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:48:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:48:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:48:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:48:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:48:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:48:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:48:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:48:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:48:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:48:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:48:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:48:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:48:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:48:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:48:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:48:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:48:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:48:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:48:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:48:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419277751] [2024-11-10 09:48:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419277751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:48:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:48:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:48:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887913553] [2024-11-10 09:48:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:48:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:48:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:48:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:48:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:48:29,709 INFO L87 Difference]: Start difference. First operand 718 states and 989 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:48:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:48:30,189 INFO L93 Difference]: Finished difference Result 1507 states and 2075 transitions. [2024-11-10 09:48:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:48:30,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-10 09:48:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:48:30,196 INFO L225 Difference]: With dead ends: 1507 [2024-11-10 09:48:30,197 INFO L226 Difference]: Without dead ends: 818 [2024-11-10 09:48:30,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:48:30,199 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 130 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:48:30,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 495 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:48:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states.