/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 01:28:13,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 01:28:13,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 01:28:13,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 01:28:13,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 01:28:13,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 01:28:13,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 01:28:13,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 01:28:13,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 01:28:13,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 01:28:13,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 01:28:13,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 01:28:13,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 01:28:13,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 01:28:13,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 01:28:13,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 01:28:13,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 01:28:13,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 01:28:13,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 01:28:13,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 01:28:13,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 01:28:13,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 01:28:13,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 01:28:13,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 01:28:13,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 01:28:13,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 01:28:13,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 01:28:13,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 01:28:13,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 01:28:13,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 01:28:13,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 01:28:13,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 01:28:13,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 01:28:13,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 01:28:13,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 01:28:13,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 01:28:13,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 01:28:13,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 01:28:13,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 01:28:13,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 01:28:13,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 01:28:13,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 01:28:13,547 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 01:28:13,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 01:28:13,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 01:28:13,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 01:28:13,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 01:28:13,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 01:28:13,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 01:28:13,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 01:28:13,549 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 01:28:13,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 01:28:13,550 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 01:28:13,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 01:28:13,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 01:28:13,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 01:28:13,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:28:13,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 01:28:13,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 01:28:13,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 01:28:13,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 01:28:13,553 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 01:28:13,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 01:28:13,553 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 01:28:13,553 INFO L138 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 [2023-03-31 01:28:13,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 01:28:13,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 01:28:13,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 01:28:13,799 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 01:28:13,800 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 01:28:13,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2023-03-31 01:28:15,097 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 01:28:15,324 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 01:28:15,325 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2023-03-31 01:28:15,333 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ca48e6b/82654e1fb79e4860974c31f2a5fe1277/FLAGf07b6824f [2023-03-31 01:28:15,348 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ca48e6b/82654e1fb79e4860974c31f2a5fe1277 [2023-03-31 01:28:15,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 01:28:15,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 01:28:15,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 01:28:15,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 01:28:15,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 01:28:15,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2695a95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15, skipping insertion in model container [2023-03-31 01:28:15,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 01:28:15,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 01:28:15,661 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2023-03-31 01:28:15,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:28:15,679 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 01:28:15,748 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2023-03-31 01:28:15,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:28:15,777 INFO L208 MainTranslator]: Completed translation [2023-03-31 01:28:15,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15 WrapperNode [2023-03-31 01:28:15,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 01:28:15,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 01:28:15,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 01:28:15,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 01:28:15,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,867 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 01:28:15,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 01:28:15,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 01:28:15,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 01:28:15,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (1/1) ... [2023-03-31 01:28:15,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:28:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:15,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-31 01:28:15,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-31 01:28:15,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 01:28:15,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 01:28:15,948 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 01:28:15,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 01:28:15,948 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-03-31 01:28:15,948 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-03-31 01:28:15,949 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-03-31 01:28:15,949 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2023-03-31 01:28:15,949 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-03-31 01:28:15,949 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 01:28:15,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-03-31 01:28:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 01:28:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 01:28:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure read [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-03-31 01:28:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure init [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2023-03-31 01:28:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 01:28:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 01:28:16,119 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 01:28:16,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 01:28:16,699 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 01:28:16,707 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 01:28:16,708 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-31 01:28:16,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:28:16 BoogieIcfgContainer [2023-03-31 01:28:16,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 01:28:16,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 01:28:16,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 01:28:16,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 01:28:16,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 01:28:15" (1/3) ... [2023-03-31 01:28:16,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523bb563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:28:16, skipping insertion in model container [2023-03-31 01:28:16,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:28:15" (2/3) ... [2023-03-31 01:28:16,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523bb563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:28:16, skipping insertion in model container [2023-03-31 01:28:16,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:28:16" (3/3) ... [2023-03-31 01:28:16,718 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2023-03-31 01:28:16,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 01:28:16,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 01:28:16,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 01:28:16,814 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@37c69b6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 01:28:16,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 01:28:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 149 states have internal predecessors, (223), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-03-31 01:28:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-31 01:28:16,828 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:16,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:16,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:16,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 176585446, now seen corresponding path program 1 times [2023-03-31 01:28:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296892735] [2023-03-31 01:28:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296892735] [2023-03-31 01:28:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296892735] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388484009] [2023-03-31 01:28:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:17,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:17,264 INFO L87 Difference]: Start difference. First operand has 207 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 149 states have internal predecessors, (223), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 01:28:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:18,568 INFO L93 Difference]: Finished difference Result 412 states and 680 transitions. [2023-03-31 01:28:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-03-31 01:28:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:18,581 INFO L225 Difference]: With dead ends: 412 [2023-03-31 01:28:18,581 INFO L226 Difference]: Without dead ends: 214 [2023-03-31 01:28:18,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:18,589 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 202 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:18,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 269 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-03-31 01:28:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2023-03-31 01:28:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 146 states have (on average 1.5205479452054795) internal successors, (222), 150 states have internal predecessors, (222), 46 states have call successors, (46), 16 states have call predecessors, (46), 15 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-03-31 01:28:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 313 transitions. [2023-03-31 01:28:18,686 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 313 transitions. Word has length 21 [2023-03-31 01:28:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:18,686 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 313 transitions. [2023-03-31 01:28:18,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 01:28:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 313 transitions. [2023-03-31 01:28:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-03-31 01:28:18,689 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:18,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:18,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 01:28:18,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:18,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -811300398, now seen corresponding path program 1 times [2023-03-31 01:28:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027798251] [2023-03-31 01:28:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027798251] [2023-03-31 01:28:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027798251] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:18,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:18,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548929169] [2023-03-31 01:28:18,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:18,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:18,861 INFO L87 Difference]: Start difference. First operand 208 states and 313 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 01:28:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:19,963 INFO L93 Difference]: Finished difference Result 427 states and 649 transitions. [2023-03-31 01:28:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-03-31 01:28:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:19,968 INFO L225 Difference]: With dead ends: 427 [2023-03-31 01:28:19,969 INFO L226 Difference]: Without dead ends: 228 [2023-03-31 01:28:19,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:19,975 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 210 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:19,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 269 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-03-31 01:28:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2023-03-31 01:28:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 157 states have (on average 1.5031847133757963) internal successors, (236), 161 states have internal predecessors, (236), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-03-31 01:28:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2023-03-31 01:28:20,078 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 22 [2023-03-31 01:28:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:20,078 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2023-03-31 01:28:20,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 01:28:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2023-03-31 01:28:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-31 01:28:20,085 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:20,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 01:28:20,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:20,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1051479533, now seen corresponding path program 1 times [2023-03-31 01:28:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72376113] [2023-03-31 01:28:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72376113] [2023-03-31 01:28:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72376113] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 01:28:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237403631] [2023-03-31 01:28:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 01:28:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 01:28:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 01:28:20,263 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 01:28:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:21,100 INFO L93 Difference]: Finished difference Result 459 states and 695 transitions. [2023-03-31 01:28:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 01:28:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-03-31 01:28:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:21,105 INFO L225 Difference]: With dead ends: 459 [2023-03-31 01:28:21,105 INFO L226 Difference]: Without dead ends: 254 [2023-03-31 01:28:21,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:21,111 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 221 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:21,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 184 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-03-31 01:28:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 223. [2023-03-31 01:28:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 163 states have internal predecessors, (238), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-03-31 01:28:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2023-03-31 01:28:21,168 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 30 [2023-03-31 01:28:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:21,168 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2023-03-31 01:28:21,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 01:28:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2023-03-31 01:28:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-03-31 01:28:21,170 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:21,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:21,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 01:28:21,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:21,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash -167964388, now seen corresponding path program 1 times [2023-03-31 01:28:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211450765] [2023-03-31 01:28:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:21,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:21,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211450765] [2023-03-31 01:28:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211450765] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 01:28:21,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991377758] [2023-03-31 01:28:21,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:21,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 01:28:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 01:28:21,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:21,383 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:22,524 INFO L93 Difference]: Finished difference Result 436 states and 653 transitions. [2023-03-31 01:28:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-03-31 01:28:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:22,527 INFO L225 Difference]: With dead ends: 436 [2023-03-31 01:28:22,527 INFO L226 Difference]: Without dead ends: 235 [2023-03-31 01:28:22,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:22,529 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 182 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:22,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 354 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-03-31 01:28:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2023-03-31 01:28:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 166 states have internal predecessors, (241), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2023-03-31 01:28:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 335 transitions. [2023-03-31 01:28:22,563 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 335 transitions. Word has length 38 [2023-03-31 01:28:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:22,563 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 335 transitions. [2023-03-31 01:28:22,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 335 transitions. [2023-03-31 01:28:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-03-31 01:28:22,564 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:22,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:22,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 01:28:22,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:22,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1498863891, now seen corresponding path program 1 times [2023-03-31 01:28:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:22,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144372456] [2023-03-31 01:28:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144372456] [2023-03-31 01:28:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144372456] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505135292] [2023-03-31 01:28:22,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:22,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:22,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:22,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:28:22,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 01:28:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 01:28:22,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:28:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:22,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 01:28:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505135292] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 01:28:22,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 01:28:22,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-03-31 01:28:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957084262] [2023-03-31 01:28:22,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 01:28:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 01:28:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 01:28:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:22,984 INFO L87 Difference]: Start difference. First operand 227 states and 335 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-31 01:28:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:24,218 INFO L93 Difference]: Finished difference Result 500 states and 758 transitions. [2023-03-31 01:28:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2023-03-31 01:28:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:24,221 INFO L225 Difference]: With dead ends: 500 [2023-03-31 01:28:24,221 INFO L226 Difference]: Without dead ends: 294 [2023-03-31 01:28:24,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:24,222 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 275 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:24,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 354 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:28:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-03-31 01:28:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2023-03-31 01:28:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 205 states have (on average 1.473170731707317) internal successors, (302), 209 states have internal predecessors, (302), 57 states have call successors, (57), 17 states have call predecessors, (57), 17 states have return successors, (57), 57 states have call predecessors, (57), 56 states have call successors, (57) [2023-03-31 01:28:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 416 transitions. [2023-03-31 01:28:24,265 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 416 transitions. Word has length 41 [2023-03-31 01:28:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:24,266 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 416 transitions. [2023-03-31 01:28:24,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-31 01:28:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 416 transitions. [2023-03-31 01:28:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-03-31 01:28:24,267 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:24,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:24,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-31 01:28:24,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:24,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:24,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1643706338, now seen corresponding path program 1 times [2023-03-31 01:28:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983422731] [2023-03-31 01:28:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:28:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:28:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983422731] [2023-03-31 01:28:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983422731] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:24,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-03-31 01:28:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735093408] [2023-03-31 01:28:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:24,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 01:28:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 01:28:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:24,714 INFO L87 Difference]: Start difference. First operand 280 states and 416 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-03-31 01:28:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:26,218 INFO L93 Difference]: Finished difference Result 450 states and 673 transitions. [2023-03-31 01:28:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-03-31 01:28:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-03-31 01:28:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:26,220 INFO L225 Difference]: With dead ends: 450 [2023-03-31 01:28:26,220 INFO L226 Difference]: Without dead ends: 280 [2023-03-31 01:28:26,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:28:26,222 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 182 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:26,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 495 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-31 01:28:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-03-31 01:28:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2023-03-31 01:28:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 206 states have internal predecessors, (292), 57 states have call successors, (57), 17 states have call predecessors, (57), 16 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-03-31 01:28:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2023-03-31 01:28:26,263 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 45 [2023-03-31 01:28:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:26,263 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2023-03-31 01:28:26,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-03-31 01:28:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2023-03-31 01:28:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-03-31 01:28:26,264 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:26,265 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 01:28:26,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:26,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1279182573, now seen corresponding path program 2 times [2023-03-31 01:28:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096129018] [2023-03-31 01:28:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-03-31 01:28:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096129018] [2023-03-31 01:28:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096129018] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311957659] [2023-03-31 01:28:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:26,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:26,412 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:27,485 INFO L93 Difference]: Finished difference Result 530 states and 801 transitions. [2023-03-31 01:28:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2023-03-31 01:28:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:27,488 INFO L225 Difference]: With dead ends: 530 [2023-03-31 01:28:27,488 INFO L226 Difference]: Without dead ends: 289 [2023-03-31 01:28:27,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:27,489 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 197 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:27,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 269 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-03-31 01:28:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2023-03-31 01:28:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 208 states have (on average 1.4423076923076923) internal successors, (300), 212 states have internal predecessors, (300), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-03-31 01:28:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2023-03-31 01:28:27,529 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 63 [2023-03-31 01:28:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:27,529 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2023-03-31 01:28:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2023-03-31 01:28:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-03-31 01:28:27,530 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:27,530 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:27,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-31 01:28:27,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:27,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1977696004, now seen corresponding path program 1 times [2023-03-31 01:28:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945211894] [2023-03-31 01:28:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-03-31 01:28:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945211894] [2023-03-31 01:28:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945211894] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698845747] [2023-03-31 01:28:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:27,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:27,657 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:28,641 INFO L93 Difference]: Finished difference Result 574 states and 852 transitions. [2023-03-31 01:28:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2023-03-31 01:28:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:28,645 INFO L225 Difference]: With dead ends: 574 [2023-03-31 01:28:28,645 INFO L226 Difference]: Without dead ends: 326 [2023-03-31 01:28:28,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:28,647 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 200 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:28,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 269 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-03-31 01:28:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 319. [2023-03-31 01:28:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 240 states have (on average 1.4041666666666666) internal successors, (337), 244 states have internal predecessors, (337), 60 states have call successors, (60), 19 states have call predecessors, (60), 18 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2023-03-31 01:28:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 456 transitions. [2023-03-31 01:28:28,690 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 456 transitions. Word has length 63 [2023-03-31 01:28:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:28,691 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 456 transitions. [2023-03-31 01:28:28,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-31 01:28:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 456 transitions. [2023-03-31 01:28:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-03-31 01:28:28,692 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:28,692 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 01:28:28,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:28,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1949760353, now seen corresponding path program 1 times [2023-03-31 01:28:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456668491] [2023-03-31 01:28:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-03-31 01:28:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456668491] [2023-03-31 01:28:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456668491] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 01:28:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950839188] [2023-03-31 01:28:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:28,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 01:28:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:28,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 01:28:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:28,908 INFO L87 Difference]: Start difference. First operand 319 states and 456 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:29,985 INFO L93 Difference]: Finished difference Result 585 states and 851 transitions. [2023-03-31 01:28:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 81 [2023-03-31 01:28:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:29,987 INFO L225 Difference]: With dead ends: 585 [2023-03-31 01:28:29,987 INFO L226 Difference]: Without dead ends: 325 [2023-03-31 01:28:29,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:29,989 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 173 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 354 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-03-31 01:28:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2023-03-31 01:28:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 240 states have (on average 1.3916666666666666) internal successors, (334), 244 states have internal predecessors, (334), 60 states have call successors, (60), 19 states have call predecessors, (60), 18 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2023-03-31 01:28:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 453 transitions. [2023-03-31 01:28:30,057 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 453 transitions. Word has length 81 [2023-03-31 01:28:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:30,058 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 453 transitions. [2023-03-31 01:28:30,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 453 transitions. [2023-03-31 01:28:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-03-31 01:28:30,059 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:30,059 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:30,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 01:28:30,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:30,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1542465688, now seen corresponding path program 1 times [2023-03-31 01:28:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573693716] [2023-03-31 01:28:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-03-31 01:28:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573693716] [2023-03-31 01:28:30,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573693716] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:30,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831396995] [2023-03-31 01:28:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:30,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:30,226 INFO L87 Difference]: Start difference. First operand 319 states and 453 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:31,253 INFO L93 Difference]: Finished difference Result 622 states and 907 transitions. [2023-03-31 01:28:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 110 [2023-03-31 01:28:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:31,256 INFO L225 Difference]: With dead ends: 622 [2023-03-31 01:28:31,256 INFO L226 Difference]: Without dead ends: 367 [2023-03-31 01:28:31,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:31,258 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 201 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:31,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 269 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-03-31 01:28:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 360. [2023-03-31 01:28:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 277 states have (on average 1.3574007220216606) internal successors, (376), 281 states have internal predecessors, (376), 63 states have call successors, (63), 20 states have call predecessors, (63), 19 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2023-03-31 01:28:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 501 transitions. [2023-03-31 01:28:31,348 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 501 transitions. Word has length 110 [2023-03-31 01:28:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:31,350 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 501 transitions. [2023-03-31 01:28:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 501 transitions. [2023-03-31 01:28:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-03-31 01:28:31,355 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:31,356 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:31,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-31 01:28:31,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:31,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1471853096, now seen corresponding path program 1 times [2023-03-31 01:28:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713166423] [2023-03-31 01:28:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-03-31 01:28:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713166423] [2023-03-31 01:28:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713166423] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778172696] [2023-03-31 01:28:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:31,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:31,511 INFO L87 Difference]: Start difference. First operand 360 states and 501 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:32,423 INFO L93 Difference]: Finished difference Result 648 states and 928 transitions. [2023-03-31 01:28:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 01:28:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 111 [2023-03-31 01:28:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:32,426 INFO L225 Difference]: With dead ends: 648 [2023-03-31 01:28:32,426 INFO L226 Difference]: Without dead ends: 358 [2023-03-31 01:28:32,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 01:28:32,428 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 184 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:32,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 269 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-03-31 01:28:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2023-03-31 01:28:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.338235294117647) internal successors, (364), 276 states have internal predecessors, (364), 62 states have call successors, (62), 20 states have call predecessors, (62), 19 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2023-03-31 01:28:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 487 transitions. [2023-03-31 01:28:32,491 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 487 transitions. Word has length 111 [2023-03-31 01:28:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:32,491 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 487 transitions. [2023-03-31 01:28:32,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-03-31 01:28:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 487 transitions. [2023-03-31 01:28:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-03-31 01:28:32,493 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:32,493 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-03-31 01:28:32,493 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:32,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1821184041, now seen corresponding path program 1 times [2023-03-31 01:28:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59376186] [2023-03-31 01:28:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-03-31 01:28:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-03-31 01:28:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59376186] [2023-03-31 01:28:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59376186] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 01:28:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257729254] [2023-03-31 01:28:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:32,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 01:28:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:32,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 01:28:32,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:32,663 INFO L87 Difference]: Start difference. First operand 354 states and 487 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-03-31 01:28:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:33,632 INFO L93 Difference]: Finished difference Result 623 states and 876 transitions. [2023-03-31 01:28:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 130 [2023-03-31 01:28:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:33,635 INFO L225 Difference]: With dead ends: 623 [2023-03-31 01:28:33,635 INFO L226 Difference]: Without dead ends: 360 [2023-03-31 01:28:33,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:33,637 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 170 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:33,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 354 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-03-31 01:28:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 354. [2023-03-31 01:28:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.3272058823529411) internal successors, (361), 276 states have internal predecessors, (361), 62 states have call successors, (62), 20 states have call predecessors, (62), 19 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2023-03-31 01:28:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 484 transitions. [2023-03-31 01:28:33,703 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 484 transitions. Word has length 130 [2023-03-31 01:28:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:33,704 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 484 transitions. [2023-03-31 01:28:33,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-03-31 01:28:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 484 transitions. [2023-03-31 01:28:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-03-31 01:28:33,705 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:33,706 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:33,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-03-31 01:28:33,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:33,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1218237282, now seen corresponding path program 1 times [2023-03-31 01:28:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265374203] [2023-03-31 01:28:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-03-31 01:28:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-03-31 01:28:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:33,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265374203] [2023-03-31 01:28:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265374203] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:33,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:33,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738367317] [2023-03-31 01:28:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:33,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:33,860 INFO L87 Difference]: Start difference. First operand 354 states and 484 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-03-31 01:28:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:34,708 INFO L93 Difference]: Finished difference Result 586 states and 837 transitions. [2023-03-31 01:28:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 01:28:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 163 [2023-03-31 01:28:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:34,711 INFO L225 Difference]: With dead ends: 586 [2023-03-31 01:28:34,711 INFO L226 Difference]: Without dead ends: 356 [2023-03-31 01:28:34,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 01:28:34,712 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 179 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:34,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 269 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-03-31 01:28:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2023-03-31 01:28:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 271 states have (on average 1.3247232472324724) internal successors, (359), 275 states have internal predecessors, (359), 61 states have call successors, (61), 20 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-03-31 01:28:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 480 transitions. [2023-03-31 01:28:34,761 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 480 transitions. Word has length 163 [2023-03-31 01:28:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:34,762 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 480 transitions. [2023-03-31 01:28:34,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-03-31 01:28:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 480 transitions. [2023-03-31 01:28:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-03-31 01:28:34,764 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:34,764 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:34,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-31 01:28:34,764 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:34,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash -389753766, now seen corresponding path program 1 times [2023-03-31 01:28:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830836437] [2023-03-31 01:28:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-03-31 01:28:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-03-31 01:28:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830836437] [2023-03-31 01:28:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830836437] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766449277] [2023-03-31 01:28:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:35,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:35,003 INFO L87 Difference]: Start difference. First operand 352 states and 480 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:28:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:35,901 INFO L93 Difference]: Finished difference Result 526 states and 732 transitions. [2023-03-31 01:28:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 186 [2023-03-31 01:28:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:35,906 INFO L225 Difference]: With dead ends: 526 [2023-03-31 01:28:35,907 INFO L226 Difference]: Without dead ends: 339 [2023-03-31 01:28:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:35,908 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 204 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:35,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 269 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-03-31 01:28:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2023-03-31 01:28:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 257 states have (on average 1.3151750972762646) internal successors, (338), 261 states have internal predecessors, (338), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-03-31 01:28:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 453 transitions. [2023-03-31 01:28:35,975 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 453 transitions. Word has length 186 [2023-03-31 01:28:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:35,975 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 453 transitions. [2023-03-31 01:28:35,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:28:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 453 transitions. [2023-03-31 01:28:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-03-31 01:28:35,977 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:35,977 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:35,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-31 01:28:35,977 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:35,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1557908577, now seen corresponding path program 1 times [2023-03-31 01:28:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776931279] [2023-03-31 01:28:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-03-31 01:28:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-03-31 01:28:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776931279] [2023-03-31 01:28:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776931279] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934139546] [2023-03-31 01:28:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:36,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:36,254 INFO L87 Difference]: Start difference. First operand 335 states and 453 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:28:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:37,217 INFO L93 Difference]: Finished difference Result 509 states and 705 transitions. [2023-03-31 01:28:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 188 [2023-03-31 01:28:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:37,219 INFO L225 Difference]: With dead ends: 509 [2023-03-31 01:28:37,219 INFO L226 Difference]: Without dead ends: 320 [2023-03-31 01:28:37,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:37,220 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 193 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:37,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 269 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-03-31 01:28:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2023-03-31 01:28:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 245 states have internal predecessors, (315), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-03-31 01:28:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 424 transitions. [2023-03-31 01:28:37,270 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 424 transitions. Word has length 188 [2023-03-31 01:28:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:37,270 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 424 transitions. [2023-03-31 01:28:37,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:28:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 424 transitions. [2023-03-31 01:28:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-03-31 01:28:37,272 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:37,273 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:37,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-31 01:28:37,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:37,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1168866853, now seen corresponding path program 1 times [2023-03-31 01:28:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376021324] [2023-03-31 01:28:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-03-31 01:28:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-03-31 01:28:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376021324] [2023-03-31 01:28:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376021324] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 01:28:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307441842] [2023-03-31 01:28:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:37,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 01:28:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 01:28:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:37,579 INFO L87 Difference]: Start difference. First operand 316 states and 424 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:28:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:38,644 INFO L93 Difference]: Finished difference Result 489 states and 675 transitions. [2023-03-31 01:28:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 01:28:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 189 [2023-03-31 01:28:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:38,646 INFO L225 Difference]: With dead ends: 489 [2023-03-31 01:28:38,646 INFO L226 Difference]: Without dead ends: 320 [2023-03-31 01:28:38,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:38,648 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 165 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 354 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-03-31 01:28:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2023-03-31 01:28:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 241 states have (on average 1.2821576763485478) internal successors, (309), 245 states have internal predecessors, (309), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-03-31 01:28:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 418 transitions. [2023-03-31 01:28:38,687 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 418 transitions. Word has length 189 [2023-03-31 01:28:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:38,689 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 418 transitions. [2023-03-31 01:28:38,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:28:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 418 transitions. [2023-03-31 01:28:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-03-31 01:28:38,691 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:38,691 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:38,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-03-31 01:28:38,691 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:38,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -759235935, now seen corresponding path program 1 times [2023-03-31 01:28:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111694087] [2023-03-31 01:28:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-03-31 01:28:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-03-31 01:28:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111694087] [2023-03-31 01:28:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111694087] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904163623] [2023-03-31 01:28:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:38,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:28:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 01:28:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 01:28:39,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:28:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-03-31 01:28:39,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 01:28:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-03-31 01:28:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904163623] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 01:28:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 6 [2023-03-31 01:28:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018094246] [2023-03-31 01:28:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:39,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 01:28:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:39,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 01:28:39,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:39,344 INFO L87 Difference]: Start difference. First operand 316 states and 418 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-03-31 01:28:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:39,415 INFO L93 Difference]: Finished difference Result 506 states and 691 transitions. [2023-03-31 01:28:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 01:28:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 196 [2023-03-31 01:28:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:39,419 INFO L225 Difference]: With dead ends: 506 [2023-03-31 01:28:39,419 INFO L226 Difference]: Without dead ends: 295 [2023-03-31 01:28:39,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-03-31 01:28:39,420 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 30 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:39,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 553 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:28:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-03-31 01:28:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-03-31 01:28:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 223 states have (on average 1.2735426008968609) internal successors, (284), 227 states have internal predecessors, (284), 52 states have call successors, (52), 20 states have call predecessors, (52), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-03-31 01:28:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 387 transitions. [2023-03-31 01:28:39,463 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 387 transitions. Word has length 196 [2023-03-31 01:28:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:39,463 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 387 transitions. [2023-03-31 01:28:39,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-03-31 01:28:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 387 transitions. [2023-03-31 01:28:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-03-31 01:28:39,467 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:39,467 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:39,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-31 01:28:39,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-03-31 01:28:39,674 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:39,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash 780251732, now seen corresponding path program 1 times [2023-03-31 01:28:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59652312] [2023-03-31 01:28:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-03-31 01:28:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59652312] [2023-03-31 01:28:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59652312] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:39,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:39,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 01:28:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757084004] [2023-03-31 01:28:39,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:39,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 01:28:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 01:28:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 01:28:39,892 INFO L87 Difference]: Start difference. First operand 295 states and 387 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-03-31 01:28:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:40,817 INFO L93 Difference]: Finished difference Result 465 states and 636 transitions. [2023-03-31 01:28:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 01:28:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 220 [2023-03-31 01:28:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:40,820 INFO L225 Difference]: With dead ends: 465 [2023-03-31 01:28:40,820 INFO L226 Difference]: Without dead ends: 305 [2023-03-31 01:28:40,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:40,824 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 168 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:40,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 262 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-03-31 01:28:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2023-03-31 01:28:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 226 states have (on average 1.2699115044247788) internal successors, (287), 230 states have internal predecessors, (287), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-03-31 01:28:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 390 transitions. [2023-03-31 01:28:40,864 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 390 transitions. Word has length 220 [2023-03-31 01:28:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:40,866 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 390 transitions. [2023-03-31 01:28:40,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-03-31 01:28:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 390 transitions. [2023-03-31 01:28:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-03-31 01:28:40,868 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:40,869 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-03-31 01:28:40,869 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:40,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 726773504, now seen corresponding path program 1 times [2023-03-31 01:28:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484008582] [2023-03-31 01:28:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-03-31 01:28:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484008582] [2023-03-31 01:28:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484008582] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553506243] [2023-03-31 01:28:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:41,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:28:41,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 01:28:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 01:28:41,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:28:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-03-31 01:28:41,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:28:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553506243] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:41,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:28:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-03-31 01:28:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133713330] [2023-03-31 01:28:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 01:28:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 01:28:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-03-31 01:28:41,379 INFO L87 Difference]: Start difference. First operand 299 states and 390 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-03-31 01:28:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:41,441 INFO L93 Difference]: Finished difference Result 470 states and 638 transitions. [2023-03-31 01:28:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 01:28:41,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 230 [2023-03-31 01:28:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:41,443 INFO L225 Difference]: With dead ends: 470 [2023-03-31 01:28:41,443 INFO L226 Difference]: Without dead ends: 306 [2023-03-31 01:28:41,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:41,444 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 7 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:41,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 856 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:28:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-03-31 01:28:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2023-03-31 01:28:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 230 states have (on average 1.2652173913043478) internal successors, (291), 234 states have internal predecessors, (291), 52 states have call successors, (52), 22 states have call predecessors, (52), 21 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-03-31 01:28:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 394 transitions. [2023-03-31 01:28:41,485 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 394 transitions. Word has length 230 [2023-03-31 01:28:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:41,485 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 394 transitions. [2023-03-31 01:28:41,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-03-31 01:28:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 394 transitions. [2023-03-31 01:28:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-03-31 01:28:41,488 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:41,488 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:41,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-03-31 01:28:41,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:41,694 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:41,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1593855937, now seen corresponding path program 1 times [2023-03-31 01:28:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202114222] [2023-03-31 01:28:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-03-31 01:28:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202114222] [2023-03-31 01:28:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202114222] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433739535] [2023-03-31 01:28:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:42,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:42,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:42,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:28:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-31 01:28:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 01:28:42,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:28:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-03-31 01:28:42,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:28:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433739535] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:28:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2023-03-31 01:28:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868278728] [2023-03-31 01:28:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:42,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 01:28:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 01:28:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-03-31 01:28:42,268 INFO L87 Difference]: Start difference. First operand 304 states and 394 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:42,329 INFO L93 Difference]: Finished difference Result 472 states and 636 transitions. [2023-03-31 01:28:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 01:28:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 241 [2023-03-31 01:28:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:42,331 INFO L225 Difference]: With dead ends: 472 [2023-03-31 01:28:42,331 INFO L226 Difference]: Without dead ends: 303 [2023-03-31 01:28:42,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:42,333 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 7 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:42,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 842 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:28:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-03-31 01:28:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2023-03-31 01:28:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 230 states have (on average 1.2521739130434784) internal successors, (288), 233 states have internal predecessors, (288), 51 states have call successors, (51), 22 states have call predecessors, (51), 21 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-03-31 01:28:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 389 transitions. [2023-03-31 01:28:42,376 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 389 transitions. Word has length 241 [2023-03-31 01:28:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:42,376 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 389 transitions. [2023-03-31 01:28:42,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 389 transitions. [2023-03-31 01:28:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-03-31 01:28:42,378 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:42,378 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:42,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-31 01:28:42,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:42,585 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:42,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1164635866, now seen corresponding path program 1 times [2023-03-31 01:28:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510327175] [2023-03-31 01:28:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-03-31 01:28:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510327175] [2023-03-31 01:28:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510327175] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:28:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549720139] [2023-03-31 01:28:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:42,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:28:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:28:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:42,944 INFO L87 Difference]: Start difference. First operand 303 states and 389 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:43,968 INFO L93 Difference]: Finished difference Result 470 states and 626 transitions. [2023-03-31 01:28:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 01:28:43,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 253 [2023-03-31 01:28:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:43,971 INFO L225 Difference]: With dead ends: 470 [2023-03-31 01:28:43,971 INFO L226 Difference]: Without dead ends: 302 [2023-03-31 01:28:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:28:43,972 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:43,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 217 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:28:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-03-31 01:28:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2023-03-31 01:28:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 230 states have (on average 1.2478260869565216) internal successors, (287), 232 states have internal predecessors, (287), 50 states have call successors, (50), 22 states have call predecessors, (50), 21 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-03-31 01:28:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 386 transitions. [2023-03-31 01:28:44,009 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 386 transitions. Word has length 253 [2023-03-31 01:28:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:44,009 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 386 transitions. [2023-03-31 01:28:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 386 transitions. [2023-03-31 01:28:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-03-31 01:28:44,011 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:44,011 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:44,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-03-31 01:28:44,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:44,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1402046120, now seen corresponding path program 1 times [2023-03-31 01:28:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314073908] [2023-03-31 01:28:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-03-31 01:28:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314073908] [2023-03-31 01:28:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314073908] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:28:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745580462] [2023-03-31 01:28:44,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:28:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:28:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:28:44,329 INFO L87 Difference]: Start difference. First operand 302 states and 386 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:46,100 INFO L93 Difference]: Finished difference Result 778 states and 1050 transitions. [2023-03-31 01:28:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:28:46,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 254 [2023-03-31 01:28:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:46,104 INFO L225 Difference]: With dead ends: 778 [2023-03-31 01:28:46,104 INFO L226 Difference]: Without dead ends: 611 [2023-03-31 01:28:46,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-03-31 01:28:46,105 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 1067 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:46,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 308 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:28:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2023-03-31 01:28:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 603. [2023-03-31 01:28:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 446 states have (on average 1.3094170403587444) internal successors, (584), 449 states have internal predecessors, (584), 105 states have call successors, (105), 50 states have call predecessors, (105), 51 states have return successors, (107), 104 states have call predecessors, (107), 104 states have call successors, (107) [2023-03-31 01:28:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 796 transitions. [2023-03-31 01:28:46,175 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 796 transitions. Word has length 254 [2023-03-31 01:28:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:46,176 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 796 transitions. [2023-03-31 01:28:46,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 796 transitions. [2023-03-31 01:28:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-03-31 01:28:46,178 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:46,178 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:46,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-03-31 01:28:46,179 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:46,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1577790359, now seen corresponding path program 1 times [2023-03-31 01:28:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576068862] [2023-03-31 01:28:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:28:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:28:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-03-31 01:28:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-31 01:28:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:28:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-03-31 01:28:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-03-31 01:28:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576068862] [2023-03-31 01:28:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576068862] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295961297] [2023-03-31 01:28:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:46,562 INFO L87 Difference]: Start difference. First operand 603 states and 796 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (26), 9 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:48,865 INFO L93 Difference]: Finished difference Result 1670 states and 2260 transitions. [2023-03-31 01:28:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:28:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (26), 9 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 294 [2023-03-31 01:28:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:48,870 INFO L225 Difference]: With dead ends: 1670 [2023-03-31 01:28:48,871 INFO L226 Difference]: Without dead ends: 1050 [2023-03-31 01:28:48,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2023-03-31 01:28:48,873 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1885 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:48,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 117 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:28:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2023-03-31 01:28:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1021. [2023-03-31 01:28:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 749 states have (on average 1.3110814419225634) internal successors, (982), 757 states have internal predecessors, (982), 178 states have call successors, (178), 87 states have call predecessors, (178), 93 states have return successors, (190), 177 states have call predecessors, (190), 177 states have call successors, (190) [2023-03-31 01:28:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1350 transitions. [2023-03-31 01:28:49,012 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1350 transitions. Word has length 294 [2023-03-31 01:28:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:49,012 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1350 transitions. [2023-03-31 01:28:49,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (26), 9 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1350 transitions. [2023-03-31 01:28:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2023-03-31 01:28:49,015 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:49,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:49,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-03-31 01:28:49,015 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:49,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1734021507, now seen corresponding path program 1 times [2023-03-31 01:28:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580152239] [2023-03-31 01:28:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:28:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:28:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2023-03-31 01:28:49,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580152239] [2023-03-31 01:28:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580152239] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:28:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041027321] [2023-03-31 01:28:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:49,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:28:49,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:28:49,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:28:49,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-31 01:28:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 01:28:49,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:28:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2023-03-31 01:28:49,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:28:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041027321] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:28:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2023-03-31 01:28:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530691390] [2023-03-31 01:28:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:49,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 01:28:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 01:28:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-03-31 01:28:49,684 INFO L87 Difference]: Start difference. First operand 1021 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-03-31 01:28:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:49,847 INFO L93 Difference]: Finished difference Result 1931 states and 2596 transitions. [2023-03-31 01:28:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 01:28:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 296 [2023-03-31 01:28:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:49,854 INFO L225 Difference]: With dead ends: 1931 [2023-03-31 01:28:49,855 INFO L226 Difference]: Without dead ends: 1057 [2023-03-31 01:28:49,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:28:49,859 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 15 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:49,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 767 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:28:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-03-31 01:28:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2023-03-31 01:28:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 779 states have (on average 1.3145057766367136) internal successors, (1024), 787 states have internal predecessors, (1024), 178 states have call successors, (178), 93 states have call predecessors, (178), 99 states have return successors, (190), 177 states have call predecessors, (190), 177 states have call successors, (190) [2023-03-31 01:28:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1392 transitions. [2023-03-31 01:28:50,011 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1392 transitions. Word has length 296 [2023-03-31 01:28:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:50,011 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1392 transitions. [2023-03-31 01:28:50,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-03-31 01:28:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1392 transitions. [2023-03-31 01:28:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-03-31 01:28:50,014 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:50,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:50,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-31 01:28:50,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-03-31 01:28:50,224 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:50,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1698172905, now seen corresponding path program 1 times [2023-03-31 01:28:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714886787] [2023-03-31 01:28:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:28:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:28:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-03-31 01:28:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-03-31 01:28:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:50,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714886787] [2023-03-31 01:28:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714886787] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:28:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295459711] [2023-03-31 01:28:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:50,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:28:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:28:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:28:50,575 INFO L87 Difference]: Start difference. First operand 1057 states and 1392 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:52,666 INFO L93 Difference]: Finished difference Result 2840 states and 3812 transitions. [2023-03-31 01:28:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-03-31 01:28:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 297 [2023-03-31 01:28:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:52,684 INFO L225 Difference]: With dead ends: 2840 [2023-03-31 01:28:52,685 INFO L226 Difference]: Without dead ends: 1918 [2023-03-31 01:28:52,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2023-03-31 01:28:52,689 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1658 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:52,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 88 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-03-31 01:28:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2023-03-31 01:28:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1900. [2023-03-31 01:28:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1390 states have (on average 1.3258992805755396) internal successors, (1843), 1412 states have internal predecessors, (1843), 321 states have call successors, (321), 168 states have call predecessors, (321), 188 states have return successors, (353), 319 states have call predecessors, (353), 320 states have call successors, (353) [2023-03-31 01:28:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2517 transitions. [2023-03-31 01:28:52,964 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2517 transitions. Word has length 297 [2023-03-31 01:28:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:52,965 INFO L495 AbstractCegarLoop]: Abstraction has 1900 states and 2517 transitions. [2023-03-31 01:28:52,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2517 transitions. [2023-03-31 01:28:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-03-31 01:28:52,982 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:52,983 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:52,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-03-31 01:28:52,983 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:52,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2135922880, now seen corresponding path program 1 times [2023-03-31 01:28:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660712797] [2023-03-31 01:28:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-03-31 01:28:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-03-31 01:28:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-03-31 01:28:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-03-31 01:28:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:28:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:28:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:28:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2023-03-31 01:28:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660712797] [2023-03-31 01:28:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660712797] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:28:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685725482] [2023-03-31 01:28:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:28:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:28:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:28:53,365 INFO L87 Difference]: Start difference. First operand 1900 states and 2517 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (27), 9 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-03-31 01:28:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:55,252 INFO L93 Difference]: Finished difference Result 3679 states and 4910 transitions. [2023-03-31 01:28:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-03-31 01:28:55,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (27), 9 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 305 [2023-03-31 01:28:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:55,263 INFO L225 Difference]: With dead ends: 3679 [2023-03-31 01:28:55,264 INFO L226 Difference]: Without dead ends: 1960 [2023-03-31 01:28:55,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2023-03-31 01:28:55,271 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1042 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:55,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 84 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:28:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2023-03-31 01:28:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1904. [2023-03-31 01:28:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1393 states have (on average 1.3208901651112706) internal successors, (1840), 1415 states have internal predecessors, (1840), 321 states have call successors, (321), 169 states have call predecessors, (321), 189 states have return successors, (345), 319 states have call predecessors, (345), 320 states have call successors, (345) [2023-03-31 01:28:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2506 transitions. [2023-03-31 01:28:55,583 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2506 transitions. Word has length 305 [2023-03-31 01:28:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:55,584 INFO L495 AbstractCegarLoop]: Abstraction has 1904 states and 2506 transitions. [2023-03-31 01:28:55,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (27), 9 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-03-31 01:28:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2506 transitions. [2023-03-31 01:28:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-03-31 01:28:55,590 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:55,591 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:55,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-03-31 01:28:55,592 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:55,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -321935166, now seen corresponding path program 1 times [2023-03-31 01:28:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687015156] [2023-03-31 01:28:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:28:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:28:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:28:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:28:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:28:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-03-31 01:28:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687015156] [2023-03-31 01:28:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687015156] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:56,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:28:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493909040] [2023-03-31 01:28:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:56,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:28:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:28:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:28:56,037 INFO L87 Difference]: Start difference. First operand 1904 states and 2506 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:58,450 INFO L93 Difference]: Finished difference Result 5238 states and 6996 transitions. [2023-03-31 01:28:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:28:58,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 298 [2023-03-31 01:28:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:58,464 INFO L225 Difference]: With dead ends: 5238 [2023-03-31 01:28:58,464 INFO L226 Difference]: Without dead ends: 3519 [2023-03-31 01:28:58,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:58,469 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1551 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:58,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 123 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:28:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2023-03-31 01:28:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3485. [2023-03-31 01:28:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2536 states have (on average 1.3304416403785488) internal successors, (3374), 2592 states have internal predecessors, (3374), 589 states have call successors, (589), 305 states have call predecessors, (589), 359 states have return successors, (651), 587 states have call predecessors, (651), 588 states have call successors, (651) [2023-03-31 01:28:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4614 transitions. [2023-03-31 01:28:59,082 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4614 transitions. Word has length 298 [2023-03-31 01:28:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:59,082 INFO L495 AbstractCegarLoop]: Abstraction has 3485 states and 4614 transitions. [2023-03-31 01:28:59,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (26), 9 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-03-31 01:28:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4614 transitions. [2023-03-31 01:28:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-03-31 01:28:59,089 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:59,090 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:59,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-03-31 01:28:59,090 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:59,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1693742464, now seen corresponding path program 1 times [2023-03-31 01:28:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98179423] [2023-03-31 01:28:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:28:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:28:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:28:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:28:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:28:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:28:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:28:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:28:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:28:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:28:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:28:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:28:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:28:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:28:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:28:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:28:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:28:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:28:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:28:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:28:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-03-31 01:28:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98179423] [2023-03-31 01:28:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98179423] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-03-31 01:28:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536734848] [2023-03-31 01:28:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:59,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 01:28:59,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 01:28:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-03-31 01:28:59,793 INFO L87 Difference]: Start difference. First operand 3485 states and 4614 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (26), 9 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2023-03-31 01:29:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:29:01,541 INFO L93 Difference]: Finished difference Result 3735 states and 5043 transitions. [2023-03-31 01:29:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 01:29:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (26), 9 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 298 [2023-03-31 01:29:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:29:01,559 INFO L225 Difference]: With dead ends: 3735 [2023-03-31 01:29:01,559 INFO L226 Difference]: Without dead ends: 3733 [2023-03-31 01:29:01,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2023-03-31 01:29:01,561 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 733 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:29:01,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 170 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:29:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2023-03-31 01:29:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3605. [2023-03-31 01:29:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3605 states, 2608 states have (on average 1.321319018404908) internal successors, (3446), 2688 states have internal predecessors, (3446), 601 states have call successors, (601), 317 states have call predecessors, (601), 395 states have return successors, (695), 599 states have call predecessors, (695), 600 states have call successors, (695) [2023-03-31 01:29:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3605 states and 4742 transitions. [2023-03-31 01:29:02,128 INFO L78 Accepts]: Start accepts. Automaton has 3605 states and 4742 transitions. Word has length 298 [2023-03-31 01:29:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:29:02,129 INFO L495 AbstractCegarLoop]: Abstraction has 3605 states and 4742 transitions. [2023-03-31 01:29:02,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (26), 9 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2023-03-31 01:29:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3605 states and 4742 transitions. [2023-03-31 01:29:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2023-03-31 01:29:02,136 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:29:02,136 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:29:02,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-03-31 01:29:02,136 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:29:02,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:29:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -746979320, now seen corresponding path program 1 times [2023-03-31 01:29:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:29:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996922851] [2023-03-31 01:29:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:29:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:29:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:29:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:29:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:29:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:29:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-03-31 01:29:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-03-31 01:29:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-03-31 01:29:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:29:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 01:29:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:29:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-03-31 01:29:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-03-31 01:29:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:29:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:29:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-03-31 01:29:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:29:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:29:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-03-31 01:29:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-03-31 01:29:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-03-31 01:29:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:29:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-03-31 01:29:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:29:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-03-31 01:29:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:29:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-03-31 01:29:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:29:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-03-31 01:29:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-03-31 01:29:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:29:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:29:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:29:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-03-31 01:29:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-03-31 01:29:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:29:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996922851] [2023-03-31 01:29:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996922851] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:29:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403302442] [2023-03-31 01:29:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:29:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:29:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:29:02,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:29:02,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-31 01:29:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:29:03,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 14 conjunts are in the unsatisfiable core [2023-03-31 01:29:03,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:29:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-03-31 01:29:03,481 INFO L327 TraceCheckSpWp]: Computing backward predicates...