./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.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 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:01:00,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:01:00,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:01:00,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:01:00,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:01:00,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:01:00,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:01:00,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:01:00,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:01:00,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:01:00,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:01:00,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:01:00,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:01:00,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:01:00,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:01:00,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:01:00,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:01:00,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:01:00,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:01:00,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:01:00,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:01:00,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:01:00,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:01:00,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:01:00,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:01:00,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:01:00,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:01:00,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:01:00,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:01:00,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:01:00,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:01:00,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:01:00,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:00,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:01:00,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:01:00,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:01:00,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:01:00,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:01:00,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:01:00,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:01:00,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:01:00,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:01:00,916 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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2024-11-10 10:01:01,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:01:01,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:01:01,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:01:01,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:01:01,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:01:01,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-10 10:01:02,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:01:02,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:01:02,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-10 10:01:02,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d6fe85/ca521e57978249299d33453e6c98793b/FLAG00744a7d9 [2024-11-10 10:01:03,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d6fe85/ca521e57978249299d33453e6c98793b [2024-11-10 10:01:03,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:01:03,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:01:03,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:03,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:01:03,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:01:03,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5ba1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03, skipping insertion in model container [2024-11-10 10:01:03,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:01:03,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-11-10 10:01:03,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:03,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:01:03,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-11-10 10:01:03,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:03,568 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:01:03,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03 WrapperNode [2024-11-10 10:01:03,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:03,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:03,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:01:03,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:01:03,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,631 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-10 10:01:03,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:03,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:01:03,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:01:03,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:01:03,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,707 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-10 10:01:03,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:01:03,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:01:03,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:01:03,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:01:03,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (1/1) ... [2024-11-10 10:01:03,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:03,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:01:03,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:01:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:01:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:01:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:01:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:01:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:01:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:01:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:01:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:01:03,923 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:01:03,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:01:04,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2024-11-10 10:01:04,305 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-10 10:01:04,306 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:01:04,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:01:04,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:01:04,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:04 BoogieIcfgContainer [2024-11-10 10:01:04,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:01:04,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:01:04,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:01:04,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:01:04,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:03" (1/3) ... [2024-11-10 10:01:04,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4669f492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:04, skipping insertion in model container [2024-11-10 10:01:04,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:03" (2/3) ... [2024-11-10 10:01:04,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4669f492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:04, skipping insertion in model container [2024-11-10 10:01:04,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:04" (3/3) ... [2024-11-10 10:01:04,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2024-11-10 10:01:04,347 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:01:04,347 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:01:04,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:01:04,393 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;@2b19de6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:01:04,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:01:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 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 10:01:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 10:01:04,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,409 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] [2024-11-10 10:01:04,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2121661626, now seen corresponding path program 1 times [2024-11-10 10:01:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234616591] [2024-11-10 10:01:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,796 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 10:01:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234616591] [2024-11-10 10:01:04,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234616591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:04,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:04,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:01:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465588531] [2024-11-10 10:01:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:04,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:01:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:01:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:01:04,860 INFO L87 Difference]: Start difference. First operand has 108 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 10:01:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:04,886 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2024-11-10 10:01:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:01:04,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 146 [2024-11-10 10:01:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:04,910 INFO L225 Difference]: With dead ends: 208 [2024-11-10 10:01:04,914 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 10:01:04,920 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 10:01:04,927 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:04,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 10:01:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 10:01:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 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 10:01:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2024-11-10 10:01:04,984 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 146 [2024-11-10 10:01:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2024-11-10 10:01:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 10:01:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2024-11-10 10:01:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 10:01:04,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,991 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] [2024-11-10 10:01:04,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:01:04,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1620202041, now seen corresponding path program 1 times [2024-11-10 10:01:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197152341] [2024-11-10 10:01:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,335 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 10:01:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197152341] [2024-11-10 10:01:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197152341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291075910] [2024-11-10 10:01:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:05,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:05,340 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 10:01:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:05,383 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2024-11-10 10:01:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 146 [2024-11-10 10:01:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:05,385 INFO L225 Difference]: With dead ends: 206 [2024-11-10 10:01:05,385 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 10:01:05,386 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 10:01:05,386 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:05,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 10:01:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-10 10:01:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 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 10:01:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-11-10 10:01:05,395 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 146 [2024-11-10 10:01:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:05,398 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-11-10 10:01:05,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 10:01:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-11-10 10:01:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 10:01:05,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:05,404 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] [2024-11-10 10:01:05,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:01:05,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash 122608294, now seen corresponding path program 1 times [2024-11-10 10:01:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:05,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115109623] [2024-11-10 10:01:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,779 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 10:01:06,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:06,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115109623] [2024-11-10 10:01:06,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115109623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:06,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:01:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177261458] [2024-11-10 10:01:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:01:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:01:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:06,784 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:01:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:07,422 INFO L93 Difference]: Finished difference Result 242 states and 339 transitions. [2024-11-10 10:01:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2024-11-10 10:01:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:07,426 INFO L225 Difference]: With dead ends: 242 [2024-11-10 10:01:07,426 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 10:01:07,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:01:07,430 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 140 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:07,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 319 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 10:01:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 10:01:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2024-11-10 10:01:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 102 states have internal predecessors, (127), 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 10:01:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-10 10:01:07,460 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 146 [2024-11-10 10:01:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:07,461 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-10 10:01:07,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:01:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-10 10:01:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 10:01:07,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:07,462 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] [2024-11-10 10:01:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:01:07,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 636672442, now seen corresponding path program 1 times [2024-11-10 10:01:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345557714] [2024-11-10 10:01:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,254 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 10:01:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345557714] [2024-11-10 10:01:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345557714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:01:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586857301] [2024-11-10 10:01:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:01:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:01:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:01:09,256 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:10,261 INFO L93 Difference]: Finished difference Result 322 states and 452 transitions. [2024-11-10 10:01:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:01:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2024-11-10 10:01:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:10,264 INFO L225 Difference]: With dead ends: 322 [2024-11-10 10:01:10,264 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 10:01:10,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-10 10:01:10,266 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 285 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:10,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 527 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 10:01:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 174. [2024-11-10 10:01:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 143 states have internal predecessors, (186), 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 10:01:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 244 transitions. [2024-11-10 10:01:10,295 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 244 transitions. Word has length 147 [2024-11-10 10:01:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:10,297 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 244 transitions. [2024-11-10 10:01:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 244 transitions. [2024-11-10 10:01:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 10:01:10,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:10,299 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] [2024-11-10 10:01:10,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:01:10,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1454160457, now seen corresponding path program 1 times [2024-11-10 10:01:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:10,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660869988] [2024-11-10 10:01:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:12,242 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 10:01:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660869988] [2024-11-10 10:01:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660869988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:12,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:01:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839305534] [2024-11-10 10:01:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:12,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:01:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:01:12,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:01:12,246 INFO L87 Difference]: Start difference. First operand 174 states and 244 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:01:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:13,443 INFO L93 Difference]: Finished difference Result 444 states and 620 transitions. [2024-11-10 10:01:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 10:01:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-11-10 10:01:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:13,445 INFO L225 Difference]: With dead ends: 444 [2024-11-10 10:01:13,445 INFO L226 Difference]: Without dead ends: 273 [2024-11-10 10:01:13,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-10 10:01:13,446 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 426 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:13,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 767 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-10 10:01:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 187. [2024-11-10 10:01:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.3225806451612903) internal successors, (205), 156 states have internal predecessors, (205), 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 10:01:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2024-11-10 10:01:13,464 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 148 [2024-11-10 10:01:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:13,465 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2024-11-10 10:01:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:01:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2024-11-10 10:01:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 10:01:13,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:13,466 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] [2024-11-10 10:01:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:01:13,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2053059899, now seen corresponding path program 1 times [2024-11-10 10:01:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566339151] [2024-11-10 10:01:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,189 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 10:01:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566339151] [2024-11-10 10:01:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566339151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:01:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912756904] [2024-11-10 10:01:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:01:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:01:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:14,191 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 10:01:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:14,513 INFO L93 Difference]: Finished difference Result 453 states and 636 transitions. [2024-11-10 10:01:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 148 [2024-11-10 10:01:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:14,515 INFO L225 Difference]: With dead ends: 453 [2024-11-10 10:01:14,515 INFO L226 Difference]: Without dead ends: 269 [2024-11-10 10:01:14,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:14,516 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 283 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:14,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 354 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-10 10:01:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 203. [2024-11-10 10:01:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.327485380116959) internal successors, (227), 172 states have internal predecessors, (227), 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 10:01:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2024-11-10 10:01:14,534 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 148 [2024-11-10 10:01:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:14,535 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2024-11-10 10:01:14,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 10:01:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2024-11-10 10:01:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 10:01:14,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:14,536 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] [2024-11-10 10:01:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:01:14,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1122510928, now seen corresponding path program 1 times [2024-11-10 10:01:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250737321] [2024-11-10 10:01:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,751 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 10:01:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250737321] [2024-11-10 10:01:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250737321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 10:01:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271253935] [2024-11-10 10:01:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:01:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:01:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:01:16,754 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:17,751 INFO L93 Difference]: Finished difference Result 498 states and 695 transitions. [2024-11-10 10:01:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:01:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-11-10 10:01:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:17,753 INFO L225 Difference]: With dead ends: 498 [2024-11-10 10:01:17,753 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 10:01:17,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 10:01:17,755 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 329 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:17,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 595 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 10:01:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 203. [2024-11-10 10:01:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.327485380116959) internal successors, (227), 172 states have internal predecessors, (227), 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 10:01:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2024-11-10 10:01:17,776 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 148 [2024-11-10 10:01:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:17,777 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2024-11-10 10:01:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2024-11-10 10:01:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:17,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:17,787 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] [2024-11-10 10:01:17,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:01:17,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 694835617, now seen corresponding path program 1 times [2024-11-10 10:01:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11393926] [2024-11-10 10:01:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:19,953 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 10:01:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11393926] [2024-11-10 10:01:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11393926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 10:01:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284644846] [2024-11-10 10:01:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:01:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:01:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:01:19,956 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:21,191 INFO L93 Difference]: Finished difference Result 449 states and 629 transitions. [2024-11-10 10:01:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:01:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2024-11-10 10:01:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:21,194 INFO L225 Difference]: With dead ends: 449 [2024-11-10 10:01:21,194 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 10:01:21,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-10 10:01:21,195 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 279 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:21,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 691 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 10:01:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 10:01:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2024-11-10 10:01:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.329479768786127) internal successors, (230), 174 states have internal predecessors, (230), 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 10:01:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 288 transitions. [2024-11-10 10:01:21,217 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 288 transitions. Word has length 149 [2024-11-10 10:01:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:21,217 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 288 transitions. [2024-11-10 10:01:21,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 288 transitions. [2024-11-10 10:01:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:21,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:21,219 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] [2024-11-10 10:01:21,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:01:21,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:21,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1548567645, now seen corresponding path program 1 times [2024-11-10 10:01:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156215223] [2024-11-10 10:01:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,059 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 10:01:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156215223] [2024-11-10 10:01:23,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156215223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:23,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:23,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 10:01:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13291411] [2024-11-10 10:01:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:23,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:01:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:01:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:01:23,061 INFO L87 Difference]: Start difference. First operand 205 states and 288 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 10:01:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:24,317 INFO L93 Difference]: Finished difference Result 485 states and 675 transitions. [2024-11-10 10:01:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:01:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 149 [2024-11-10 10:01:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:24,319 INFO L225 Difference]: With dead ends: 485 [2024-11-10 10:01:24,319 INFO L226 Difference]: Without dead ends: 283 [2024-11-10 10:01:24,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-10 10:01:24,320 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 434 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:24,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 587 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 10:01:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-10 10:01:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2024-11-10 10:01:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 227 states have (on average 1.2951541850220265) internal successors, (294), 230 states have internal predecessors, (294), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-10 10:01:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 384 transitions. [2024-11-10 10:01:24,356 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 384 transitions. Word has length 149 [2024-11-10 10:01:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:24,357 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 384 transitions. [2024-11-10 10:01:24,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 10:01:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 384 transitions. [2024-11-10 10:01:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:24,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:24,358 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] [2024-11-10 10:01:24,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:01:24,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1420595523, now seen corresponding path program 1 times [2024-11-10 10:01:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354916760] [2024-11-10 10:01:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:26,208 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 10:01:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354916760] [2024-11-10 10:01:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354916760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 10:01:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140408933] [2024-11-10 10:01:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:26,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:01:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:01:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:01:26,210 INFO L87 Difference]: Start difference. First operand 277 states and 384 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:26,901 INFO L93 Difference]: Finished difference Result 618 states and 854 transitions. [2024-11-10 10:01:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:01:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2024-11-10 10:01:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:26,904 INFO L225 Difference]: With dead ends: 618 [2024-11-10 10:01:26,904 INFO L226 Difference]: Without dead ends: 366 [2024-11-10 10:01:26,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-10 10:01:26,905 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 552 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:26,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 556 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:01:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-10 10:01:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 307. [2024-11-10 10:01:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 257 states have (on average 1.2996108949416343) internal successors, (334), 260 states have internal predecessors, (334), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-10 10:01:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2024-11-10 10:01:26,967 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 149 [2024-11-10 10:01:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:26,967 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2024-11-10 10:01:26,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2024-11-10 10:01:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:26,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:26,969 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] [2024-11-10 10:01:26,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:01:26,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1931129700, now seen corresponding path program 1 times [2024-11-10 10:01:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124190734] [2024-11-10 10:01:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,959 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 10:01:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124190734] [2024-11-10 10:01:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124190734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 10:01:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118166271] [2024-11-10 10:01:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:30,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 10:01:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 10:01:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:01:30,961 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 15 states, 12 states have (on average 4.75) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 10:01:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:33,057 INFO L93 Difference]: Finished difference Result 757 states and 1024 transitions. [2024-11-10 10:01:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:01:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.75) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 149 [2024-11-10 10:01:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:33,077 INFO L225 Difference]: With dead ends: 757 [2024-11-10 10:01:33,077 INFO L226 Difference]: Without dead ends: 475 [2024-11-10 10:01:33,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 10:01:33,078 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 360 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:33,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 901 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 10:01:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-10 10:01:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 393. [2024-11-10 10:01:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 336 states have (on average 1.2916666666666667) internal successors, (434), 341 states have internal predecessors, (434), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-10 10:01:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 532 transitions. [2024-11-10 10:01:33,142 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 532 transitions. Word has length 149 [2024-11-10 10:01:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:33,142 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 532 transitions. [2024-11-10 10:01:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.75) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 10:01:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 532 transitions. [2024-11-10 10:01:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:33,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:33,143 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] [2024-11-10 10:01:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:01:33,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -65816219, now seen corresponding path program 1 times [2024-11-10 10:01:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517861064] [2024-11-10 10:01:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:34,788 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 10:01:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517861064] [2024-11-10 10:01:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517861064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:34,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:34,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:01:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095630523] [2024-11-10 10:01:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:01:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:01:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:01:34,790 INFO L87 Difference]: Start difference. First operand 393 states and 532 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:35,570 INFO L93 Difference]: Finished difference Result 827 states and 1123 transitions. [2024-11-10 10:01:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2024-11-10 10:01:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:35,574 INFO L225 Difference]: With dead ends: 827 [2024-11-10 10:01:35,574 INFO L226 Difference]: Without dead ends: 463 [2024-11-10 10:01:35,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:01:35,575 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 422 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:35,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 334 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 10:01:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-10 10:01:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 393. [2024-11-10 10:01:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 336 states have (on average 1.2886904761904763) internal successors, (433), 341 states have internal predecessors, (433), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-10 10:01:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 531 transitions. [2024-11-10 10:01:35,685 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 531 transitions. Word has length 149 [2024-11-10 10:01:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:35,686 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 531 transitions. [2024-11-10 10:01:35,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 10:01:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 531 transitions. [2024-11-10 10:01:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:35,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:35,687 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] [2024-11-10 10:01:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:01:35,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 325781307, now seen corresponding path program 1 times [2024-11-10 10:01:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141842224] [2024-11-10 10:01:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:01:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:01:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:01:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:01:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:01:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:39,258 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 10:01:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141842224] [2024-11-10 10:01:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141842224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 10:01:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644405853] [2024-11-10 10:01:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:01:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:01:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:01:39,261 INFO L87 Difference]: Start difference. First operand 393 states and 531 transitions. Second operand has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-10 10:01:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:40,964 INFO L93 Difference]: Finished difference Result 757 states and 1024 transitions. [2024-11-10 10:01:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:01:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 149 [2024-11-10 10:01:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:40,973 INFO L225 Difference]: With dead ends: 757 [2024-11-10 10:01:40,973 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 10:01:40,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-10 10:01:40,974 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 203 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:40,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 714 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 10:01:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 10:01:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 373. [2024-11-10 10:01:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 316 states have (on average 1.2848101265822784) internal successors, (406), 321 states have internal predecessors, (406), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-10 10:01:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2024-11-10 10:01:41,081 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 149 [2024-11-10 10:01:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:41,081 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2024-11-10 10:01:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.384615384615385) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-10 10:01:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2024-11-10 10:01:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 10:01:41,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:41,084 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] [2024-11-10 10:01:41,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:01:41,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:41,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1389575716, now seen corresponding path program 1 times [2024-11-10 10:01:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:41,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071697355] [2024-11-10 10:01:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:05,594 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 10:02:19,952 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)