/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_ActiveStandby.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 01:27:52,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 01:27:52,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 01:27:52,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 01:27:52,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 01:27:52,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 01:27:52,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 01:27:52,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 01:27:52,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 01:27:52,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 01:27:52,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 01:27:52,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 01:27:52,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 01:27:52,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 01:27:52,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 01:27:52,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 01:27:52,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 01:27:52,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 01:27:52,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 01:27:52,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 01:27:52,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 01:27:52,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 01:27:52,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 01:27:52,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 01:27:52,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 01:27:52,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 01:27:52,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 01:27:52,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 01:27:52,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 01:27:52,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 01:27:52,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 01:27:52,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 01:27:52,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 01:27:52,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 01:27:52,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 01:27:52,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 01:27:52,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 01:27:52,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 01:27:52,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 01:27:52,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 01:27:52,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 01:27:52,906 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:27:52,926 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 01:27:52,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 01:27:52,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 01:27:52,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 01:27:52,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 01:27:52,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 01:27:52,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 01:27:52,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 01:27:52,928 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 01:27:52,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 01:27:52,929 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 01:27:52,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 01:27:52,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 01:27:52,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 01:27:52,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 01:27:52,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 01:27:52,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 01:27:52,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 01:27:52,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:27:52,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 01:27:52,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 01:27:52,932 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 01:27:52,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 01:27:52,933 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 01:27:52,933 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:27:53,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 01:27:53,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 01:27:53,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 01:27:53,180 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 01:27:53,181 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 01:27:53,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2023-03-31 01:27:54,270 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 01:27:54,482 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 01:27:54,483 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2023-03-31 01:27:54,492 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9d1a084/909fa8fed11f4b5b847d9802cf5dc102/FLAGc7ccf776c [2023-03-31 01:27:54,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9d1a084/909fa8fed11f4b5b847d9802cf5dc102 [2023-03-31 01:27:54,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 01:27:54,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 01:27:54,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 01:27:54,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 01:27:54,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 01:27:54,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7ccf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54, skipping insertion in model container [2023-03-31 01:27:54,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 01:27:54,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 01:27:54,779 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_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2023-03-31 01:27:54,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:27:54,796 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 01:27:54,861 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_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2023-03-31 01:27:54,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:27:54,881 INFO L208 MainTranslator]: Completed translation [2023-03-31 01:27:54,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54 WrapperNode [2023-03-31 01:27:54,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 01:27:54,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 01:27:54,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 01:27:54,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 01:27:54,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 01:27:54,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 01:27:54,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 01:27:54,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 01:27:54,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (1/1) ... [2023-03-31 01:27:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:27:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:27:54,985 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:27:54,991 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:27:55,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 01:27:55,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2023-03-31 01:27:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 01:27:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure read [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure write [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2023-03-31 01:27:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure init [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2023-03-31 01:27:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 01:27:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 01:27:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 01:27:55,168 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 01:27:55,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 01:27:55,524 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 01:27:55,531 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 01:27:55,531 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 01:27:55,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:27:55 BoogieIcfgContainer [2023-03-31 01:27:55,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 01:27:55,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 01:27:55,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 01:27:55,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 01:27:55,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 01:27:54" (1/3) ... [2023-03-31 01:27:55,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8cde96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:27:55, skipping insertion in model container [2023-03-31 01:27:55,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:54" (2/3) ... [2023-03-31 01:27:55,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8cde96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:27:55, skipping insertion in model container [2023-03-31 01:27:55,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:27:55" (3/3) ... [2023-03-31 01:27:55,538 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2023-03-31 01:27:55,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 01:27:55,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 01:27:55,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 01:27:55,590 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;@2b405a18, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 01:27:55,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 01:27:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 155 states have internal predecessors, (231), 43 states have call successors, (43), 19 states have call predecessors, (43), 19 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-03-31 01:27:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-03-31 01:27:55,600 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:55,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:27:55,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:55,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash -955273454, now seen corresponding path program 1 times [2023-03-31 01:27:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747113712] [2023-03-31 01:27:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:27:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:27:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-03-31 01:27:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,376 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:27:56,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747113712] [2023-03-31 01:27:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747113712] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-03-31 01:27:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388932815] [2023-03-31 01:27:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:56,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 01:27:56,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 01:27:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-03-31 01:27:56,413 INFO L87 Difference]: Start difference. First operand has 217 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 155 states have internal predecessors, (231), 43 states have call successors, (43), 19 states have call predecessors, (43), 19 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-03-31 01:27:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:58,402 INFO L93 Difference]: Finished difference Result 410 states and 631 transitions. [2023-03-31 01:27:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-31 01:27:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2023-03-31 01:27:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:58,410 INFO L225 Difference]: With dead ends: 410 [2023-03-31 01:27:58,410 INFO L226 Difference]: Without dead ends: 212 [2023-03-31 01:27:58,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2023-03-31 01:27:58,416 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1191 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:58,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 122 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:27:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-03-31 01:27:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2023-03-31 01:27:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.4133333333333333) internal successors, (212), 151 states have internal predecessors, (212), 43 states have call successors, (43), 19 states have call predecessors, (43), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-03-31 01:27:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 297 transitions. [2023-03-31 01:27:58,482 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 297 transitions. Word has length 56 [2023-03-31 01:27:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:58,483 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 297 transitions. [2023-03-31 01:27:58,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-03-31 01:27:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 297 transitions. [2023-03-31 01:27:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-03-31 01:27:58,485 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:58,485 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, 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:27:58,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 01:27:58,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:58,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1555108596, now seen corresponding path program 1 times [2023-03-31 01:27:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521184865] [2023-03-31 01:27:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:58,833 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:27:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521184865] [2023-03-31 01:27:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521184865] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:58,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:27:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655022201] [2023-03-31 01:27:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:58,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:27:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:27:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:27:58,836 INFO L87 Difference]: Start difference. First operand 212 states and 297 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-03-31 01:28:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:00,157 INFO L93 Difference]: Finished difference Result 404 states and 579 transitions. [2023-03-31 01:28:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-31 01:28:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2023-03-31 01:28:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:00,162 INFO L225 Difference]: With dead ends: 404 [2023-03-31 01:28:00,162 INFO L226 Difference]: Without dead ends: 216 [2023-03-31 01:28:00,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:00,171 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 372 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:00,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 95 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-03-31 01:28:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-03-31 01:28:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 154 states have internal predecessors, (215), 43 states have call successors, (43), 20 states have call predecessors, (43), 19 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-03-31 01:28:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 300 transitions. [2023-03-31 01:28:00,240 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 300 transitions. Word has length 67 [2023-03-31 01:28:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:00,240 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 300 transitions. [2023-03-31 01:28:00,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-03-31 01:28:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 300 transitions. [2023-03-31 01:28:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-03-31 01:28:00,247 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:00,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 01:28:00,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:00,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2052492885, now seen corresponding path program 1 times [2023-03-31 01:28:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978119497] [2023-03-31 01:28:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:00,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978119497] [2023-03-31 01:28:00,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978119497] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:00,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:00,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-03-31 01:28:00,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599368980] [2023-03-31 01:28:00,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:00,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 01:28:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 01:28:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:28:00,740 INFO L87 Difference]: Start difference. First operand 216 states and 300 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:28:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:02,914 INFO L93 Difference]: Finished difference Result 474 states and 659 transitions. [2023-03-31 01:28:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:28:02,915 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 89 [2023-03-31 01:28:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:02,917 INFO L225 Difference]: With dead ends: 474 [2023-03-31 01:28:02,917 INFO L226 Difference]: Without dead ends: 282 [2023-03-31 01:28:02,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 01:28:02,919 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1747 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:02,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 77 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:28:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-03-31 01:28:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2023-03-31 01:28:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 197 states have (on average 1.3908629441624365) internal successors, (274), 199 states have internal predecessors, (274), 54 states have call successors, (54), 30 states have call predecessors, (54), 29 states have return successors, (54), 51 states have call predecessors, (54), 53 states have call successors, (54) [2023-03-31 01:28:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 382 transitions. [2023-03-31 01:28:02,981 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 382 transitions. Word has length 89 [2023-03-31 01:28:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:02,981 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 382 transitions. [2023-03-31 01:28:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:28:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 382 transitions. [2023-03-31 01:28:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:28:02,982 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:02,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 01:28:02,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:02,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1787261928, now seen corresponding path program 1 times [2023-03-31 01:28:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874892113] [2023-03-31 01:28:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:28:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-03-31 01:28:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:03,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874892113] [2023-03-31 01:28:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874892113] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:03,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:03,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-03-31 01:28:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924666019] [2023-03-31 01:28:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:03,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 01:28:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 01:28:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:28:03,446 INFO L87 Difference]: Start difference. First operand 281 states and 382 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:28:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:05,567 INFO L93 Difference]: Finished difference Result 480 states and 667 transitions. [2023-03-31 01:28:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:28:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2023-03-31 01:28:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:05,569 INFO L225 Difference]: With dead ends: 480 [2023-03-31 01:28:05,569 INFO L226 Difference]: Without dead ends: 285 [2023-03-31 01:28:05,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 01:28:05,571 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1988 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:05,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 67 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-31 01:28:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-03-31 01:28:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2023-03-31 01:28:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 197 states have (on average 1.3908629441624365) internal successors, (274), 199 states have internal predecessors, (274), 54 states have call successors, (54), 30 states have call predecessors, (54), 29 states have return successors, (54), 51 states have call predecessors, (54), 53 states have call successors, (54) [2023-03-31 01:28:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 382 transitions. [2023-03-31 01:28:05,607 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 382 transitions. Word has length 90 [2023-03-31 01:28:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:05,607 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 382 transitions. [2023-03-31 01:28:05,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:28:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 382 transitions. [2023-03-31 01:28:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-03-31 01:28:05,608 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:05,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 01:28:05,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:05,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1138636726, now seen corresponding path program 1 times [2023-03-31 01:28:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:05,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977185351] [2023-03-31 01:28:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-03-31 01:28:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977185351] [2023-03-31 01:28:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977185351] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896731972] [2023-03-31 01:28:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:05,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:05,862 INFO L87 Difference]: Start difference. First operand 281 states and 382 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:08,005 INFO L93 Difference]: Finished difference Result 688 states and 961 transitions. [2023-03-31 01:28:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 92 [2023-03-31 01:28:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:08,008 INFO L225 Difference]: With dead ends: 688 [2023-03-31 01:28:08,008 INFO L226 Difference]: Without dead ends: 493 [2023-03-31 01:28:08,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:08,010 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 935 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:08,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 89 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-03-31 01:28:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-03-31 01:28:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 479. [2023-03-31 01:28:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 335 states have (on average 1.4119402985074627) internal successors, (473), 340 states have internal predecessors, (473), 94 states have call successors, (94), 48 states have call predecessors, (94), 49 states have return successors, (98), 90 states have call predecessors, (98), 93 states have call successors, (98) [2023-03-31 01:28:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 665 transitions. [2023-03-31 01:28:08,099 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 665 transitions. Word has length 92 [2023-03-31 01:28:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:08,100 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 665 transitions. [2023-03-31 01:28:08,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 665 transitions. [2023-03-31 01:28:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-03-31 01:28:08,104 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:08,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 01:28:08,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:08,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2003386767, now seen corresponding path program 1 times [2023-03-31 01:28:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904944037] [2023-03-31 01:28:08,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-03-31 01:28:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-03-31 01:28:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904944037] [2023-03-31 01:28:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904944037] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237612278] [2023-03-31 01:28:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:08,417 INFO L87 Difference]: Start difference. First operand 479 states and 665 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:10,683 INFO L93 Difference]: Finished difference Result 854 states and 1201 transitions. [2023-03-31 01:28:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 95 [2023-03-31 01:28:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:10,685 INFO L225 Difference]: With dead ends: 854 [2023-03-31 01:28:10,685 INFO L226 Difference]: Without dead ends: 493 [2023-03-31 01:28:10,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:10,687 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1235 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:10,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 106 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:28:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-03-31 01:28:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 479. [2023-03-31 01:28:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 335 states have (on average 1.408955223880597) internal successors, (472), 340 states have internal predecessors, (472), 94 states have call successors, (94), 48 states have call predecessors, (94), 49 states have return successors, (97), 90 states have call predecessors, (97), 93 states have call successors, (97) [2023-03-31 01:28:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 663 transitions. [2023-03-31 01:28:10,776 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 663 transitions. Word has length 95 [2023-03-31 01:28:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:10,777 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 663 transitions. [2023-03-31 01:28:10,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 663 transitions. [2023-03-31 01:28:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-03-31 01:28:10,778 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:10,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 01:28:10,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:10,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1948329941, now seen corresponding path program 1 times [2023-03-31 01:28:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715606091] [2023-03-31 01:28:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715606091] [2023-03-31 01:28:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715606091] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645373920] [2023-03-31 01:28:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:11,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:11,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:11,012 INFO L87 Difference]: Start difference. First operand 479 states and 663 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:13,025 INFO L93 Difference]: Finished difference Result 1186 states and 1678 transitions. [2023-03-31 01:28:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 93 [2023-03-31 01:28:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:13,029 INFO L225 Difference]: With dead ends: 1186 [2023-03-31 01:28:13,029 INFO L226 Difference]: Without dead ends: 825 [2023-03-31 01:28:13,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:13,030 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1384 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:13,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 89 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:28:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2023-03-31 01:28:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 819. [2023-03-31 01:28:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 568 states have (on average 1.4137323943661972) internal successors, (803), 580 states have internal predecessors, (803), 167 states have call successors, (167), 77 states have call predecessors, (167), 83 states have return successors, (178), 161 states have call predecessors, (178), 166 states have call successors, (178) [2023-03-31 01:28:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1148 transitions. [2023-03-31 01:28:13,161 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1148 transitions. Word has length 93 [2023-03-31 01:28:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:13,162 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1148 transitions. [2023-03-31 01:28:13,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1148 transitions. [2023-03-31 01:28:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-03-31 01:28:13,163 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:13,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-31 01:28:13,163 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:13,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 731212425, now seen corresponding path program 1 times [2023-03-31 01:28:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239099513] [2023-03-31 01:28:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-03-31 01:28:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-03-31 01:28:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239099513] [2023-03-31 01:28:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239099513] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214158469] [2023-03-31 01:28:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:13,436 INFO L87 Difference]: Start difference. First operand 819 states and 1148 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:15,502 INFO L93 Difference]: Finished difference Result 1513 states and 2146 transitions. [2023-03-31 01:28:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 95 [2023-03-31 01:28:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:15,506 INFO L225 Difference]: With dead ends: 1513 [2023-03-31 01:28:15,506 INFO L226 Difference]: Without dead ends: 830 [2023-03-31 01:28:15,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:15,508 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 651 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:15,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 106 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-03-31 01:28:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-03-31 01:28:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 824. [2023-03-31 01:28:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 572 states have (on average 1.4108391608391608) internal successors, (807), 584 states have internal predecessors, (807), 167 states have call successors, (167), 78 states have call predecessors, (167), 84 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1151 transitions. [2023-03-31 01:28:15,637 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1151 transitions. Word has length 95 [2023-03-31 01:28:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:15,637 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1151 transitions. [2023-03-31 01:28:15,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1151 transitions. [2023-03-31 01:28:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-03-31 01:28:15,638 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:15,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 01:28:15,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:15,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1066773677, now seen corresponding path program 1 times [2023-03-31 01:28:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973051962] [2023-03-31 01:28:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973051962] [2023-03-31 01:28:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973051962] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494605954] [2023-03-31 01:28:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:15,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:15,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:15,989 INFO L87 Difference]: Start difference. First operand 824 states and 1151 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 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:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:17,438 INFO L93 Difference]: Finished difference Result 1527 states and 2165 transitions. [2023-03-31 01:28:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:17,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 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 93 [2023-03-31 01:28:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:17,442 INFO L225 Difference]: With dead ends: 1527 [2023-03-31 01:28:17,442 INFO L226 Difference]: Without dead ends: 844 [2023-03-31 01:28:17,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:17,444 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 771 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:17,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 100 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2023-03-31 01:28:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2023-03-31 01:28:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 588 states have (on average 1.3996598639455782) internal successors, (823), 600 states have internal predecessors, (823), 167 states have call successors, (167), 82 states have call predecessors, (167), 88 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1167 transitions. [2023-03-31 01:28:17,575 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1167 transitions. Word has length 93 [2023-03-31 01:28:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:17,575 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 1167 transitions. [2023-03-31 01:28:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 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:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1167 transitions. [2023-03-31 01:28:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-03-31 01:28:17,578 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:17,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 01:28:17,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:17,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -287368439, now seen corresponding path program 1 times [2023-03-31 01:28:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739044069] [2023-03-31 01:28:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739044069] [2023-03-31 01:28:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739044069] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345701777] [2023-03-31 01:28:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:17,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:17,933 INFO L87 Difference]: Start difference. First operand 844 states and 1167 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-03-31 01:28:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:19,421 INFO L93 Difference]: Finished difference Result 1567 states and 2209 transitions. [2023-03-31 01:28:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2023-03-31 01:28:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:19,424 INFO L225 Difference]: With dead ends: 1567 [2023-03-31 01:28:19,424 INFO L226 Difference]: Without dead ends: 864 [2023-03-31 01:28:19,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:19,426 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1255 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:19,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 95 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-03-31 01:28:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2023-03-31 01:28:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 604 states have (on average 1.3890728476821192) internal successors, (839), 616 states have internal predecessors, (839), 167 states have call successors, (167), 86 states have call predecessors, (167), 92 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1183 transitions. [2023-03-31 01:28:19,549 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1183 transitions. Word has length 101 [2023-03-31 01:28:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:19,549 INFO L495 AbstractCegarLoop]: Abstraction has 864 states and 1183 transitions. [2023-03-31 01:28:19,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-03-31 01:28:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1183 transitions. [2023-03-31 01:28:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:28:19,551 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:19,551 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:19,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-31 01:28:19,551 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:19,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2094733677, now seen corresponding path program 1 times [2023-03-31 01:28:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553205736] [2023-03-31 01:28:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:19,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553205736] [2023-03-31 01:28:19,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553205736] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:19,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:19,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505385704] [2023-03-31 01:28:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:19,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:19,875 INFO L87 Difference]: Start difference. First operand 864 states and 1183 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:21,368 INFO L93 Difference]: Finished difference Result 1603 states and 2225 transitions. [2023-03-31 01:28:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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 109 [2023-03-31 01:28:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:21,372 INFO L225 Difference]: With dead ends: 1603 [2023-03-31 01:28:21,372 INFO L226 Difference]: Without dead ends: 880 [2023-03-31 01:28:21,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:21,374 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1421 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 90 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-03-31 01:28:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2023-03-31 01:28:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 616 states have (on average 1.3814935064935066) internal successors, (851), 628 states have internal predecessors, (851), 167 states have call successors, (167), 90 states have call predecessors, (167), 96 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1195 transitions. [2023-03-31 01:28:21,506 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1195 transitions. Word has length 109 [2023-03-31 01:28:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:21,506 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1195 transitions. [2023-03-31 01:28:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1195 transitions. [2023-03-31 01:28:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:28:21,507 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:21,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-03-31 01:28:21,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:21,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1948216783, now seen corresponding path program 1 times [2023-03-31 01:28:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395727324] [2023-03-31 01:28:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395727324] [2023-03-31 01:28:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395727324] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330455171] [2023-03-31 01:28:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:21,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:21,864 INFO L87 Difference]: Start difference. First operand 880 states and 1195 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:23,493 INFO L93 Difference]: Finished difference Result 1639 states and 2265 transitions. [2023-03-31 01:28:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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 109 [2023-03-31 01:28:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:23,498 INFO L225 Difference]: With dead ends: 1639 [2023-03-31 01:28:23,498 INFO L226 Difference]: Without dead ends: 900 [2023-03-31 01:28:23,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:23,500 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1091 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:23,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 95 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-03-31 01:28:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2023-03-31 01:28:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 632 states have (on average 1.3718354430379747) internal successors, (867), 644 states have internal predecessors, (867), 167 states have call successors, (167), 94 states have call predecessors, (167), 100 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1211 transitions. [2023-03-31 01:28:23,638 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1211 transitions. Word has length 109 [2023-03-31 01:28:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:23,638 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1211 transitions. [2023-03-31 01:28:23,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 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:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1211 transitions. [2023-03-31 01:28:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-03-31 01:28:23,640 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:23,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1] [2023-03-31 01:28:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-03-31 01:28:23,640 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:23,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -722932685, now seen corresponding path program 1 times [2023-03-31 01:28:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557797159] [2023-03-31 01:28:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-31 01:28:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:23,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557797159] [2023-03-31 01:28:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557797159] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271742043] [2023-03-31 01:28:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:23,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:23,977 INFO L87 Difference]: Start difference. First operand 900 states and 1211 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-03-31 01:28:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:25,428 INFO L93 Difference]: Finished difference Result 1683 states and 2293 transitions. [2023-03-31 01:28:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-03-31 01:28:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:25,440 INFO L225 Difference]: With dead ends: 1683 [2023-03-31 01:28:25,440 INFO L226 Difference]: Without dead ends: 924 [2023-03-31 01:28:25,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:25,442 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1019 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:25,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-03-31 01:28:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2023-03-31 01:28:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 652 states have (on average 1.3604294478527608) internal successors, (887), 664 states have internal predecessors, (887), 167 states have call successors, (167), 98 states have call predecessors, (167), 104 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-03-31 01:28:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1231 transitions. [2023-03-31 01:28:25,579 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1231 transitions. Word has length 117 [2023-03-31 01:28:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:25,580 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1231 transitions. [2023-03-31 01:28:25,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-03-31 01:28:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1231 transitions. [2023-03-31 01:28:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-03-31 01:28:25,581 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:25,582 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:25,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-31 01:28:25,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:25,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1617249183, now seen corresponding path program 1 times [2023-03-31 01:28:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:25,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144121017] [2023-03-31 01:28:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-03-31 01:28:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-03-31 01:28:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:28:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-03-31 01:28:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144121017] [2023-03-31 01:28:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144121017] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-31 01:28:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709091165] [2023-03-31 01:28:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:26,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 01:28:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 01:28:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:26,149 INFO L87 Difference]: Start difference. First operand 924 states and 1231 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 01:28:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:30,207 INFO L93 Difference]: Finished difference Result 2541 states and 3353 transitions. [2023-03-31 01:28:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-03-31 01:28:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 122 [2023-03-31 01:28:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:30,213 INFO L225 Difference]: With dead ends: 2541 [2023-03-31 01:28:30,213 INFO L226 Difference]: Without dead ends: 1746 [2023-03-31 01:28:30,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2023-03-31 01:28:30,215 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1991 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 3154 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 3154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:30,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 147 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 3154 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-03-31 01:28:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2023-03-31 01:28:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1658. [2023-03-31 01:28:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1190 states have (on average 1.3386554621848739) internal successors, (1593), 1206 states have internal predecessors, (1593), 275 states have call successors, (275), 178 states have call predecessors, (275), 192 states have return successors, (293), 273 states have call predecessors, (293), 274 states have call successors, (293) [2023-03-31 01:28:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2161 transitions. [2023-03-31 01:28:30,468 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2161 transitions. Word has length 122 [2023-03-31 01:28:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:30,468 INFO L495 AbstractCegarLoop]: Abstraction has 1658 states and 2161 transitions. [2023-03-31 01:28:30,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 01:28:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2161 transitions. [2023-03-31 01:28:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-03-31 01:28:30,469 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:30,469 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:30,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-31 01:28:30,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:30,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1398508535, now seen corresponding path program 1 times [2023-03-31 01:28:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:30,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28237279] [2023-03-31 01:28:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-03-31 01:28:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-03-31 01:28:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28237279] [2023-03-31 01:28:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28237279] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557364825] [2023-03-31 01:28:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:30,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:30,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:30,739 INFO L87 Difference]: Start difference. First operand 1658 states and 2161 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 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:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:32,266 INFO L93 Difference]: Finished difference Result 3029 states and 3975 transitions. [2023-03-31 01:28:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:32,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 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 124 [2023-03-31 01:28:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:32,272 INFO L225 Difference]: With dead ends: 3029 [2023-03-31 01:28:32,272 INFO L226 Difference]: Without dead ends: 1674 [2023-03-31 01:28:32,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:32,275 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 467 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:32,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 102 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2023-03-31 01:28:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1662. [2023-03-31 01:28:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1194 states have (on average 1.3257956448911223) internal successors, (1583), 1210 states have internal predecessors, (1583), 269 states have call successors, (269), 184 states have call predecessors, (269), 198 states have return successors, (287), 267 states have call predecessors, (287), 268 states have call successors, (287) [2023-03-31 01:28:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2139 transitions. [2023-03-31 01:28:32,507 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2139 transitions. Word has length 124 [2023-03-31 01:28:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:32,507 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2139 transitions. [2023-03-31 01:28:32,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 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:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2139 transitions. [2023-03-31 01:28:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-03-31 01:28:32,509 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:32,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:32,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-31 01:28:32,509 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:32,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -11913153, now seen corresponding path program 1 times [2023-03-31 01:28:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015250121] [2023-03-31 01:28:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-03-31 01:28:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-03-31 01:28:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:28:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-03-31 01:28:33,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:33,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015250121] [2023-03-31 01:28:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015250121] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-31 01:28:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140305729] [2023-03-31 01:28:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:33,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 01:28:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 01:28:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:33,150 INFO L87 Difference]: Start difference. First operand 1662 states and 2139 transitions. Second operand has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-03-31 01:28:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:35,512 INFO L93 Difference]: Finished difference Result 1766 states and 2288 transitions. [2023-03-31 01:28:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-03-31 01:28:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2023-03-31 01:28:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:35,518 INFO L225 Difference]: With dead ends: 1766 [2023-03-31 01:28:35,518 INFO L226 Difference]: Without dead ends: 1764 [2023-03-31 01:28:35,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2023-03-31 01:28:35,519 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 928 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:35,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 266 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:28:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2023-03-31 01:28:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1690. [2023-03-31 01:28:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1210 states have (on average 1.3214876033057852) internal successors, (1599), 1234 states have internal predecessors, (1599), 271 states have call successors, (271), 186 states have call predecessors, (271), 208 states have return successors, (301), 269 states have call predecessors, (301), 270 states have call successors, (301) [2023-03-31 01:28:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2171 transitions. [2023-03-31 01:28:35,789 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2171 transitions. Word has length 125 [2023-03-31 01:28:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:35,789 INFO L495 AbstractCegarLoop]: Abstraction has 1690 states and 2171 transitions. [2023-03-31 01:28:35,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-03-31 01:28:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2171 transitions. [2023-03-31 01:28:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-03-31 01:28:35,790 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:35,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-03-31 01:28:35,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-03-31 01:28:35,790 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:35,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash 54826752, now seen corresponding path program 1 times [2023-03-31 01:28:35,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:35,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778222090] [2023-03-31 01:28:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:36,090 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 56 [2023-03-31 01:28:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:36,170 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 92 [2023-03-31 01:28:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-03-31 01:28:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-03-31 01:28:36,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778222090] [2023-03-31 01:28:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778222090] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-03-31 01:28:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671864361] [2023-03-31 01:28:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:36,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 01:28:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 01:28:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-03-31 01:28:36,191 INFO L87 Difference]: Start difference. First operand 1690 states and 2171 transitions. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2023-03-31 01:28:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:39,454 INFO L93 Difference]: Finished difference Result 3446 states and 4391 transitions. [2023-03-31 01:28:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-03-31 01:28:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) Word has length 126 [2023-03-31 01:28:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:39,461 INFO L225 Difference]: With dead ends: 3446 [2023-03-31 01:28:39,461 INFO L226 Difference]: Without dead ends: 2127 [2023-03-31 01:28:39,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2023-03-31 01:28:39,465 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1900 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:39,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 134 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:28:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2023-03-31 01:28:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1850. [2023-03-31 01:28:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1330 states have (on average 1.3075187969924813) internal successors, (1739), 1354 states have internal predecessors, (1739), 291 states have call successors, (291), 206 states have call predecessors, (291), 228 states have return successors, (313), 289 states have call predecessors, (313), 290 states have call successors, (313) [2023-03-31 01:28:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2343 transitions. [2023-03-31 01:28:39,776 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2343 transitions. Word has length 126 [2023-03-31 01:28:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:39,777 INFO L495 AbstractCegarLoop]: Abstraction has 1850 states and 2343 transitions. [2023-03-31 01:28:39,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2023-03-31 01:28:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2343 transitions. [2023-03-31 01:28:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-03-31 01:28:39,779 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:39,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:39,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-03-31 01:28:39,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:39,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1726671997, now seen corresponding path program 1 times [2023-03-31 01:28:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581892641] [2023-03-31 01:28:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-03-31 01:28:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-03-31 01:28:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:28:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-03-31 01:28:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-03-31 01:28:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581892641] [2023-03-31 01:28:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581892641] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-31 01:28:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204600759] [2023-03-31 01:28:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:40,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 01:28:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 01:28:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:40,242 INFO L87 Difference]: Start difference. First operand 1850 states and 2343 transitions. Second operand has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-03-31 01:28:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:44,888 INFO L93 Difference]: Finished difference Result 4817 states and 6079 transitions. [2023-03-31 01:28:44,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-03-31 01:28:44,889 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 130 [2023-03-31 01:28:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:44,898 INFO L225 Difference]: With dead ends: 4817 [2023-03-31 01:28:44,898 INFO L226 Difference]: Without dead ends: 3394 [2023-03-31 01:28:44,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2023-03-31 01:28:44,902 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2931 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 3616 mSolverCounterSat, 1079 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1079 IncrementalHoareTripleChecker+Valid, 3616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:44,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2963 Valid, 152 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1079 Valid, 3616 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-03-31 01:28:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2023-03-31 01:28:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2310. [2023-03-31 01:28:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 1655 states have (on average 1.3051359516616314) internal successors, (2160), 1691 states have internal predecessors, (2160), 365 states have call successors, (365), 259 states have call predecessors, (365), 289 states have return successors, (395), 359 states have call predecessors, (395), 364 states have call successors, (395) [2023-03-31 01:28:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 2920 transitions. [2023-03-31 01:28:45,301 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 2920 transitions. Word has length 130 [2023-03-31 01:28:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:45,301 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 2920 transitions. [2023-03-31 01:28:45,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-03-31 01:28:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 2920 transitions. [2023-03-31 01:28:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-03-31 01:28:45,302 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:45,302 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:45,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-03-31 01:28:45,302 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:45,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash -199831963, now seen corresponding path program 1 times [2023-03-31 01:28:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385400280] [2023-03-31 01:28:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-03-31 01:28:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-03-31 01:28:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-03-31 01:28:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-03-31 01:28:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-31 01:28:45,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385400280] [2023-03-31 01:28:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385400280] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:45,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-31 01:28:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922130875] [2023-03-31 01:28:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:45,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 01:28:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 01:28:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:45,787 INFO L87 Difference]: Start difference. First operand 2310 states and 2920 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) [2023-03-31 01:28:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:49,361 INFO L93 Difference]: Finished difference Result 4588 states and 5895 transitions. [2023-03-31 01:28:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-31 01:28:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) Word has length 131 [2023-03-31 01:28:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:49,371 INFO L225 Difference]: With dead ends: 4588 [2023-03-31 01:28:49,371 INFO L226 Difference]: Without dead ends: 2581 [2023-03-31 01:28:49,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=1179, Unknown=0, NotChecked=0, Total=1560 [2023-03-31 01:28:49,375 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1516 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:49,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 173 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-03-31 01:28:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2023-03-31 01:28:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2228. [2023-03-31 01:28:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1591 states have (on average 1.2947831552482716) internal successors, (2060), 1623 states have internal predecessors, (2060), 357 states have call successors, (357), 253 states have call predecessors, (357), 279 states have return successors, (383), 351 states have call predecessors, (383), 356 states have call successors, (383) [2023-03-31 01:28:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2800 transitions. [2023-03-31 01:28:49,777 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2800 transitions. Word has length 131 [2023-03-31 01:28:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:49,778 INFO L495 AbstractCegarLoop]: Abstraction has 2228 states and 2800 transitions. [2023-03-31 01:28:49,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) [2023-03-31 01:28:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2800 transitions. [2023-03-31 01:28:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-03-31 01:28:49,779 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:49,779 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:49,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-03-31 01:28:49,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:49,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1658859466, now seen corresponding path program 1 times [2023-03-31 01:28:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400242008] [2023-03-31 01:28:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:28:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-03-31 01:28:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-03-31 01:28:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-03-31 01:28:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-31 01:28:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:28:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-03-31 01:28:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-03-31 01:28:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-31 01:28:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:50,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400242008] [2023-03-31 01:28:50,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400242008] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:50,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:50,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-03-31 01:28:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829574480] [2023-03-31 01:28:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:50,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 01:28:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 01:28:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-03-31 01:28:50,067 INFO L87 Difference]: Start difference. First operand 2228 states and 2800 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19)