/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/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:52:48,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:52:48,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:52:48,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:52:48,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:52:48,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:52:48,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:52:48,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:52:48,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:52:48,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:52:48,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:52:48,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:52:48,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:52:48,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:52:48,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:52:48,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:52:48,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:52:48,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:52:48,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:52:48,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:52:48,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:52:48,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:52:48,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:52:48,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:52:48,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:52:48,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:52:48,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:52:48,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:52:48,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:52:48,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:52:48,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:52:48,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:52:48,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:52:48,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:52:48,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:52:48,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:52:48,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:52:48,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:52:48,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:52:48,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:52:48,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:52:48,497 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-04-02 04:52:48,533 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:52:48,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:52:48,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:52:48,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:52:48,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:52:48,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:52:48,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:52:48,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:52:48,535 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:52:48,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:52:48,536 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:52:48,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:52:48,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:52:48,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:52:48,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:52:48,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:52:48,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:52:48,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:48,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:52:48,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:52:48,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:52:48,539 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:52:48,539 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-04-02 04:52:48,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:52:48,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:52:48,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:52:48,794 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:52:48,795 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:52:48,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-04-02 04:52:50,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:52:50,267 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:52:50,267 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-04-02 04:52:50,284 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1a94586/44e8903d07504c79a03a94d9c26b411b/FLAGd8ff32b1a [2023-04-02 04:52:50,301 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1a94586/44e8903d07504c79a03a94d9c26b411b [2023-04-02 04:52:50,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:52:50,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:52:50,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:50,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:52:50,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:52:50,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1a9e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50, skipping insertion in model container [2023-04-02 04:52:50,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:52:50,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:52:50,453 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/systemc/transmitter.03.cil.c[706,719] [2023-04-02 04:52:50,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:50,514 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:52:50,526 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/systemc/transmitter.03.cil.c[706,719] [2023-04-02 04:52:50,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:52:50,565 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:52:50,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50 WrapperNode [2023-04-02 04:52:50,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:52:50,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:52:50,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:52:50,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:52:50,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:52:50,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:52:50,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:52:50,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:52:50,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (1/1) ... [2023-04-02 04:52:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:52:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:52:50,645 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-04-02 04:52:50,647 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-04-02 04:52:50,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-04-02 04:52:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-02 04:52:50,683 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-02 04:52:50,684 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-02 04:52:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-02 04:52:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-02 04:52:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:52:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-04-02 04:52:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-02 04:52:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:52:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:52:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:52:50,774 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:52:50,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:52:51,189 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:52:51,198 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:52:51,198 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-04-02 04:52:51,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:51 BoogieIcfgContainer [2023-04-02 04:52:51,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:52:51,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:52:51,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:52:51,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:52:51,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:52:50" (1/3) ... [2023-04-02 04:52:51,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc46fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:51, skipping insertion in model container [2023-04-02 04:52:51,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:52:50" (2/3) ... [2023-04-02 04:52:51,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc46fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:52:51, skipping insertion in model container [2023-04-02 04:52:51,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:52:51" (3/3) ... [2023-04-02 04:52:51,207 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2023-04-02 04:52:51,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:52:51,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:52:51,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:52:51,294 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;@569f50e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:52:51,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:52:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 147 states have internal predecessors, (215), 34 states have call successors, (34), 24 states have call predecessors, (34), 24 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-04-02 04:52:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:52:51,310 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:51,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:52:51,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:51,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash 350887552, now seen corresponding path program 1 times [2023-04-02 04:52:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:51,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220097180] [2023-04-02 04:52:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:52:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:52:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:52:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:52:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:52:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220097180] [2023-04-02 04:52:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220097180] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:51,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:52:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633778295] [2023-04-02 04:52:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:51,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:52:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:52:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:52:52,035 INFO L87 Difference]: Start difference. First operand has 199 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 147 states have internal predecessors, (215), 34 states have call successors, (34), 24 states have call predecessors, (34), 24 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:53,591 INFO L93 Difference]: Finished difference Result 493 states and 764 transitions. [2023-04-02 04:52:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:52:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:52:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:53,604 INFO L225 Difference]: With dead ends: 493 [2023-04-02 04:52:53,604 INFO L226 Difference]: Without dead ends: 298 [2023-04-02 04:52:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:52:53,612 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 660 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 44 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:52:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-04-02 04:52:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 190. [2023-04-02 04:52:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 140 states have internal predecessors, (193), 34 states have call successors, (34), 24 states have call predecessors, (34), 21 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-04-02 04:52:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2023-04-02 04:52:53,727 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2023-04-02 04:52:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:53,728 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2023-04-02 04:52:53,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2023-04-02 04:52:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:52:53,736 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:53,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:52:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:52:53,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:53,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1345581250, now seen corresponding path program 1 times [2023-04-02 04:52:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735521990] [2023-04-02 04:52:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:52:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:52:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:52:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:52:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:52:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735521990] [2023-04-02 04:52:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735521990] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:52:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579448532] [2023-04-02 04:52:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:52:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:52:54,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:52:54,127 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:55,824 INFO L93 Difference]: Finished difference Result 715 states and 1057 transitions. [2023-04-02 04:52:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:52:55,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:52:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:55,834 INFO L225 Difference]: With dead ends: 715 [2023-04-02 04:52:55,834 INFO L226 Difference]: Without dead ends: 546 [2023-04-02 04:52:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:52:55,842 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 989 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:55,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 16 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:52:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-04-02 04:52:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 355. [2023-04-02 04:52:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.45) internal successors, (377), 272 states have internal predecessors, (377), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-04-02 04:52:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2023-04-02 04:52:55,971 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 105 [2023-04-02 04:52:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:55,972 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2023-04-02 04:52:55,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2023-04-02 04:52:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:52:55,975 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:55,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:52:55,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:52:55,976 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:55,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -244999231, now seen corresponding path program 1 times [2023-04-02 04:52:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145908005] [2023-04-02 04:52:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:52:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:52:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:52:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:52:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:52:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:56,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145908005] [2023-04-02 04:52:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145908005] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125516387] [2023-04-02 04:52:56,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:56,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:56,320 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:57,483 INFO L93 Difference]: Finished difference Result 865 states and 1249 transitions. [2023-04-02 04:52:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 04:52:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:52:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:57,487 INFO L225 Difference]: With dead ends: 865 [2023-04-02 04:52:57,488 INFO L226 Difference]: Without dead ends: 531 [2023-04-02 04:52:57,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:52:57,490 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 970 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:57,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 17 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 04:52:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-04-02 04:52:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 355. [2023-04-02 04:52:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.4230769230769231) internal successors, (370), 272 states have internal predecessors, (370), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-04-02 04:52:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 481 transitions. [2023-04-02 04:52:57,546 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 481 transitions. Word has length 105 [2023-04-02 04:52:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:57,547 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 481 transitions. [2023-04-02 04:52:57,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 481 transitions. [2023-04-02 04:52:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:52:57,548 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:57,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:52:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:52:57,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:57,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -601237435, now seen corresponding path program 1 times [2023-04-02 04:52:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005128525] [2023-04-02 04:52:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:52:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:52:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:52:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:52:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:52:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005128525] [2023-04-02 04:52:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005128525] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:57,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411806190] [2023-04-02 04:52:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:57,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:57,795 INFO L87 Difference]: Start difference. First operand 355 states and 481 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:52:59,050 INFO L93 Difference]: Finished difference Result 862 states and 1228 transitions. [2023-04-02 04:52:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 04:52:59,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:52:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:52:59,054 INFO L225 Difference]: With dead ends: 862 [2023-04-02 04:52:59,054 INFO L226 Difference]: Without dead ends: 528 [2023-04-02 04:52:59,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-04-02 04:52:59,056 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 896 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:52:59,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 16 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:52:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-04-02 04:52:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 355. [2023-04-02 04:52:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 260 states have (on average 1.396153846153846) internal successors, (363), 272 states have internal predecessors, (363), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (56), 53 states have call predecessors, (56), 52 states have call successors, (56) [2023-04-02 04:52:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2023-04-02 04:52:59,123 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 105 [2023-04-02 04:52:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:52:59,123 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2023-04-02 04:52:59,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:52:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2023-04-02 04:52:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:52:59,125 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:52:59,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:52:59,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:52:59,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:52:59,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:52:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1721107647, now seen corresponding path program 1 times [2023-04-02 04:52:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:52:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851090993] [2023-04-02 04:52:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:52:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:52:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:52:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:52:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:52:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:52:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:52:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:52:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:52:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:52:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:52:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:52:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:52:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:52:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:52:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:52:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:52:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851090993] [2023-04-02 04:52:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851090993] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:52:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:52:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:52:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731971068] [2023-04-02 04:52:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:52:59,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:52:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:52:59,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:52:59,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:52:59,430 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:01,119 INFO L93 Difference]: Finished difference Result 1049 states and 1544 transitions. [2023-04-02 04:53:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 04:53:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:01,124 INFO L225 Difference]: With dead ends: 1049 [2023-04-02 04:53:01,124 INFO L226 Difference]: Without dead ends: 715 [2023-04-02 04:53:01,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:53:01,126 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 847 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:01,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 18 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:53:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-04-02 04:53:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 447. [2023-04-02 04:53:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 330 states have (on average 1.3545454545454545) internal successors, (447), 342 states have internal predecessors, (447), 65 states have call successors, (65), 52 states have call predecessors, (65), 51 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2023-04-02 04:53:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 578 transitions. [2023-04-02 04:53:01,211 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 578 transitions. Word has length 105 [2023-04-02 04:53:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:01,212 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 578 transitions. [2023-04-02 04:53:01,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 578 transitions. [2023-04-02 04:53:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:01,213 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:01,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:01,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:53:01,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:01,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1391547075, now seen corresponding path program 1 times [2023-04-02 04:53:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262063852] [2023-04-02 04:53:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262063852] [2023-04-02 04:53:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262063852] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:53:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031013072] [2023-04-02 04:53:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:01,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:53:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:53:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:53:01,463 INFO L87 Difference]: Start difference. First operand 447 states and 578 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:04,427 INFO L93 Difference]: Finished difference Result 1866 states and 2593 transitions. [2023-04-02 04:53:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-02 04:53:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:04,441 INFO L225 Difference]: With dead ends: 1866 [2023-04-02 04:53:04,442 INFO L226 Difference]: Without dead ends: 1440 [2023-04-02 04:53:04,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-04-02 04:53:04,445 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1440 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:04,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 16 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-04-02 04:53:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2023-04-02 04:53:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1102. [2023-04-02 04:53:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 819 states have (on average 1.3650793650793651) internal successors, (1118), 876 states have internal predecessors, (1118), 154 states have call successors, (154), 112 states have call predecessors, (154), 128 states have return successors, (221), 154 states have call predecessors, (221), 151 states have call successors, (221) [2023-04-02 04:53:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1493 transitions. [2023-04-02 04:53:04,652 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1493 transitions. Word has length 105 [2023-04-02 04:53:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:04,652 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1493 transitions. [2023-04-02 04:53:04,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1493 transitions. [2023-04-02 04:53:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:04,654 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:04,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:04,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:53:04,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:04,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1364481473, now seen corresponding path program 1 times [2023-04-02 04:53:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75336642] [2023-04-02 04:53:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75336642] [2023-04-02 04:53:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75336642] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068005441] [2023-04-02 04:53:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:04,869 INFO L87 Difference]: Start difference. First operand 1102 states and 1493 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:06,497 INFO L93 Difference]: Finished difference Result 2851 states and 4122 transitions. [2023-04-02 04:53:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 04:53:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:06,509 INFO L225 Difference]: With dead ends: 2851 [2023-04-02 04:53:06,510 INFO L226 Difference]: Without dead ends: 1771 [2023-04-02 04:53:06,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:53:06,513 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1617 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:06,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 16 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:53:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2023-04-02 04:53:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1280. [2023-04-02 04:53:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 957 states have (on average 1.3322884012539185) internal successors, (1275), 1014 states have internal predecessors, (1275), 172 states have call successors, (172), 134 states have call predecessors, (172), 150 states have return successors, (237), 172 states have call predecessors, (237), 169 states have call successors, (237) [2023-04-02 04:53:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1684 transitions. [2023-04-02 04:53:06,710 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1684 transitions. Word has length 105 [2023-04-02 04:53:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:06,711 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1684 transitions. [2023-04-02 04:53:06,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1684 transitions. [2023-04-02 04:53:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:06,714 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:06,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 04:53:06,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:06,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 620275607, now seen corresponding path program 1 times [2023-04-02 04:53:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741324992] [2023-04-02 04:53:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741324992] [2023-04-02 04:53:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741324992] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:07,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:07,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:53:07,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058160396] [2023-04-02 04:53:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:07,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:53:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:53:07,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:53:07,030 INFO L87 Difference]: Start difference. First operand 1280 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:10,222 INFO L93 Difference]: Finished difference Result 4445 states and 5920 transitions. [2023-04-02 04:53:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-02 04:53:10,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:10,238 INFO L225 Difference]: With dead ends: 4445 [2023-04-02 04:53:10,238 INFO L226 Difference]: Without dead ends: 3271 [2023-04-02 04:53:10,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-04-02 04:53:10,242 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1469 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:10,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 16 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-04-02 04:53:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-04-02 04:53:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 2530. [2023-04-02 04:53:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 1909 states have (on average 1.3310633839706654) internal successors, (2541), 2013 states have internal predecessors, (2541), 320 states have call successors, (320), 269 states have call predecessors, (320), 300 states have return successors, (432), 321 states have call predecessors, (432), 317 states have call successors, (432) [2023-04-02 04:53:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3293 transitions. [2023-04-02 04:53:10,628 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3293 transitions. Word has length 105 [2023-04-02 04:53:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:10,629 INFO L495 AbstractCegarLoop]: Abstraction has 2530 states and 3293 transitions. [2023-04-02 04:53:10,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3293 transitions. [2023-04-02 04:53:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:10,634 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:10,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:10,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 04:53:10,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:10,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1240325862, now seen corresponding path program 1 times [2023-04-02 04:53:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958714709] [2023-04-02 04:53:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958714709] [2023-04-02 04:53:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958714709] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:10,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469608128] [2023-04-02 04:53:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:10,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:10,863 INFO L87 Difference]: Start difference. First operand 2530 states and 3293 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:12,867 INFO L93 Difference]: Finished difference Result 5597 states and 7498 transitions. [2023-04-02 04:53:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:53:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-04-02 04:53:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:12,882 INFO L225 Difference]: With dead ends: 5597 [2023-04-02 04:53:12,882 INFO L226 Difference]: Without dead ends: 3089 [2023-04-02 04:53:12,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:53:12,890 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 538 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:12,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 36 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-02 04:53:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2023-04-02 04:53:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2545. [2023-04-02 04:53:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1921 states have (on average 1.3149401353461738) internal successors, (2526), 2025 states have internal predecessors, (2526), 320 states have call successors, (320), 269 states have call predecessors, (320), 303 states have return successors, (435), 324 states have call predecessors, (435), 317 states have call successors, (435) [2023-04-02 04:53:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3281 transitions. [2023-04-02 04:53:13,334 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3281 transitions. Word has length 105 [2023-04-02 04:53:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:13,334 INFO L495 AbstractCegarLoop]: Abstraction has 2545 states and 3281 transitions. [2023-04-02 04:53:13,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3281 transitions. [2023-04-02 04:53:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:13,337 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:13,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:13,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 04:53:13,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:13,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1657722468, now seen corresponding path program 1 times [2023-04-02 04:53:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284551131] [2023-04-02 04:53:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284551131] [2023-04-02 04:53:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284551131] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152271299] [2023-04-02 04:53:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:13,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:13,555 INFO L87 Difference]: Start difference. First operand 2545 states and 3281 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:15,346 INFO L93 Difference]: Finished difference Result 5900 states and 7875 transitions. [2023-04-02 04:53:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:53:15,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-04-02 04:53:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:15,363 INFO L225 Difference]: With dead ends: 5900 [2023-04-02 04:53:15,363 INFO L226 Difference]: Without dead ends: 3377 [2023-04-02 04:53:15,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:53:15,371 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 506 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:15,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 36 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:53:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2023-04-02 04:53:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2675. [2023-04-02 04:53:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2025 states have (on average 1.2967901234567902) internal successors, (2626), 2129 states have internal predecessors, (2626), 320 states have call successors, (320), 269 states have call predecessors, (320), 329 states have return successors, (461), 350 states have call predecessors, (461), 317 states have call successors, (461) [2023-04-02 04:53:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3407 transitions. [2023-04-02 04:53:15,868 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3407 transitions. Word has length 105 [2023-04-02 04:53:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:15,868 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3407 transitions. [2023-04-02 04:53:15,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:53:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3407 transitions. [2023-04-02 04:53:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:15,870 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:15,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 04:53:15,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:15,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash -764236130, now seen corresponding path program 1 times [2023-04-02 04:53:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762842721] [2023-04-02 04:53:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762842721] [2023-04-02 04:53:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762842721] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074317053] [2023-04-02 04:53:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:16,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:16,118 INFO L87 Difference]: Start difference. First operand 2675 states and 3407 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:18,768 INFO L93 Difference]: Finished difference Result 5293 states and 6918 transitions. [2023-04-02 04:53:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:53:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:18,787 INFO L225 Difference]: With dead ends: 5293 [2023-04-02 04:53:18,788 INFO L226 Difference]: Without dead ends: 3846 [2023-04-02 04:53:18,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-04-02 04:53:18,794 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2030 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:18,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 17 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-04-02 04:53:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2023-04-02 04:53:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3086. [2023-04-02 04:53:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2344 states have (on average 1.2875426621160408) internal successors, (3018), 2448 states have internal predecessors, (3018), 354 states have call successors, (354), 318 states have call predecessors, (354), 387 states have return successors, (531), 391 states have call predecessors, (531), 351 states have call successors, (531) [2023-04-02 04:53:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3903 transitions. [2023-04-02 04:53:19,406 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3903 transitions. Word has length 105 [2023-04-02 04:53:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:19,407 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3903 transitions. [2023-04-02 04:53:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3903 transitions. [2023-04-02 04:53:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:19,409 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:19,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-02 04:53:19,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:19,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 621967264, now seen corresponding path program 1 times [2023-04-02 04:53:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652689623] [2023-04-02 04:53:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652689623] [2023-04-02 04:53:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652689623] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:19,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:53:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850658244] [2023-04-02 04:53:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:19,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:53:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:53:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:53:19,660 INFO L87 Difference]: Start difference. First operand 3086 states and 3903 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:22,990 INFO L93 Difference]: Finished difference Result 9103 states and 11998 transitions. [2023-04-02 04:53:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-02 04:53:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:23,020 INFO L225 Difference]: With dead ends: 9103 [2023-04-02 04:53:23,021 INFO L226 Difference]: Without dead ends: 6097 [2023-04-02 04:53:23,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2023-04-02 04:53:23,033 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2052 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:23,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 17 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 04:53:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6097 states. [2023-04-02 04:53:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6097 to 4497. [2023-04-02 04:53:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4497 states, 3423 states have (on average 1.2956470931931054) internal successors, (4435), 3583 states have internal predecessors, (4435), 518 states have call successors, (518), 463 states have call predecessors, (518), 555 states have return successors, (864), 565 states have call predecessors, (864), 515 states have call successors, (864) [2023-04-02 04:53:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5817 transitions. [2023-04-02 04:53:23,951 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5817 transitions. Word has length 105 [2023-04-02 04:53:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:23,951 INFO L495 AbstractCegarLoop]: Abstraction has 4497 states and 5817 transitions. [2023-04-02 04:53:23,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5817 transitions. [2023-04-02 04:53:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-04-02 04:53:23,953 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:23,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:23,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-04-02 04:53:23,953 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:23,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1749771998, now seen corresponding path program 1 times [2023-04-02 04:53:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845130963] [2023-04-02 04:53:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845130963] [2023-04-02 04:53:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845130963] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:53:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246573152] [2023-04-02 04:53:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:53:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:53:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:53:24,132 INFO L87 Difference]: Start difference. First operand 4497 states and 5817 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:27,124 INFO L93 Difference]: Finished difference Result 14782 states and 20555 transitions. [2023-04-02 04:53:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 04:53:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2023-04-02 04:53:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:27,171 INFO L225 Difference]: With dead ends: 14782 [2023-04-02 04:53:27,172 INFO L226 Difference]: Without dead ends: 10366 [2023-04-02 04:53:27,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:53:27,191 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1327 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:27,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 13 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:53:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2023-04-02 04:53:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 8005. [2023-04-02 04:53:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8005 states, 6065 states have (on average 1.3111294311624073) internal successors, (7952), 6436 states have internal predecessors, (7952), 993 states have call successors, (993), 772 states have call predecessors, (993), 946 states have return successors, (1788), 1082 states have call predecessors, (1788), 990 states have call successors, (1788) [2023-04-02 04:53:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 10733 transitions. [2023-04-02 04:53:28,526 INFO L78 Accepts]: Start accepts. Automaton has 8005 states and 10733 transitions. Word has length 105 [2023-04-02 04:53:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:28,527 INFO L495 AbstractCegarLoop]: Abstraction has 8005 states and 10733 transitions. [2023-04-02 04:53:28,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8005 states and 10733 transitions. [2023-04-02 04:53:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-04-02 04:53:28,528 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:28,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-04-02 04:53:28,529 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:28,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1825504858, now seen corresponding path program 1 times [2023-04-02 04:53:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253826859] [2023-04-02 04:53:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253826859] [2023-04-02 04:53:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253826859] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:53:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624943782] [2023-04-02 04:53:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:28,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:53:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:53:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:53:28,690 INFO L87 Difference]: Start difference. First operand 8005 states and 10733 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:33,506 INFO L93 Difference]: Finished difference Result 28533 states and 41255 transitions. [2023-04-02 04:53:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 04:53:33,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2023-04-02 04:53:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:33,594 INFO L225 Difference]: With dead ends: 28533 [2023-04-02 04:53:33,594 INFO L226 Difference]: Without dead ends: 20673 [2023-04-02 04:53:33,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:53:33,629 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1024 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:33,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 13 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-04-02 04:53:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20673 states. [2023-04-02 04:53:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20673 to 16617. [2023-04-02 04:53:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16617 states, 12521 states have (on average 1.3103585975561058) internal successors, (16407), 13329 states have internal predecessors, (16407), 2153 states have call successors, (2153), 1417 states have call predecessors, (2153), 1942 states have return successors, (4782), 2489 states have call predecessors, (4782), 2150 states have call successors, (4782) [2023-04-02 04:53:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16617 states to 16617 states and 23342 transitions. [2023-04-02 04:53:36,386 INFO L78 Accepts]: Start accepts. Automaton has 16617 states and 23342 transitions. Word has length 106 [2023-04-02 04:53:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:36,386 INFO L495 AbstractCegarLoop]: Abstraction has 16617 states and 23342 transitions. [2023-04-02 04:53:36,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16617 states and 23342 transitions. [2023-04-02 04:53:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-04-02 04:53:36,389 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:36,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-04-02 04:53:36,389 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:36,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 880852289, now seen corresponding path program 1 times [2023-04-02 04:53:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566938507] [2023-04-02 04:53:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566938507] [2023-04-02 04:53:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566938507] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:53:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38425403] [2023-04-02 04:53:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:36,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:53:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:53:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:53:36,543 INFO L87 Difference]: Start difference. First operand 16617 states and 23342 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:44,568 INFO L93 Difference]: Finished difference Result 55528 states and 85640 transitions. [2023-04-02 04:53:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 04:53:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2023-04-02 04:53:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:44,773 INFO L225 Difference]: With dead ends: 55528 [2023-04-02 04:53:44,773 INFO L226 Difference]: Without dead ends: 39056 [2023-04-02 04:53:44,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:53:44,852 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:44,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 13 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:53:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39056 states. [2023-04-02 04:53:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 30018. [2023-04-02 04:53:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30018 states, 22612 states have (on average 1.3302671148062974) internal successors, (30080), 24418 states have internal predecessors, (30080), 4077 states have call successors, (4077), 2239 states have call predecessors, (4077), 3328 states have return successors, (10253), 4698 states have call predecessors, (10253), 4074 states have call successors, (10253) [2023-04-02 04:53:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30018 states to 30018 states and 44410 transitions. [2023-04-02 04:53:50,313 INFO L78 Accepts]: Start accepts. Automaton has 30018 states and 44410 transitions. Word has length 107 [2023-04-02 04:53:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:53:50,315 INFO L495 AbstractCegarLoop]: Abstraction has 30018 states and 44410 transitions. [2023-04-02 04:53:50,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30018 states and 44410 transitions. [2023-04-02 04:53:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-04-02 04:53:50,317 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:53:50,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:53:50,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-04-02 04:53:50,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:53:50,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:53:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 110118723, now seen corresponding path program 1 times [2023-04-02 04:53:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:53:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708008019] [2023-04-02 04:53:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:53:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:53:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:53:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:53:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:53:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:53:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:53:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:53:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:53:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:53:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:53:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:53:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:53:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:53:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:53:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:53:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:53:50,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708008019] [2023-04-02 04:53:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708008019] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:53:50,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:53:50,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 04:53:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034323255] [2023-04-02 04:53:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:53:50,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 04:53:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:53:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 04:53:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:53:50,436 INFO L87 Difference]: Start difference. First operand 30018 states and 44410 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:53:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:53:57,354 INFO L93 Difference]: Finished difference Result 64672 states and 96653 transitions. [2023-04-02 04:53:57,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 04:53:57,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2023-04-02 04:53:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:53:57,515 INFO L225 Difference]: With dead ends: 64672 [2023-04-02 04:53:57,515 INFO L226 Difference]: Without dead ends: 34783 [2023-04-02 04:53:57,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:53:57,626 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 749 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:53:57,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 14 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:53:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34783 states. [2023-04-02 04:54:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34783 to 29884. [2023-04-02 04:54:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29884 states, 22512 states have (on average 1.3307569296375266) internal successors, (29958), 24314 states have internal predecessors, (29958), 4061 states have call successors, (4061), 2227 states have call predecessors, (4061), 3310 states have return successors, (10227), 4678 states have call predecessors, (10227), 4058 states have call successors, (10227) [2023-04-02 04:54:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 44246 transitions. [2023-04-02 04:54:03,074 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 44246 transitions. Word has length 107 [2023-04-02 04:54:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:54:03,075 INFO L495 AbstractCegarLoop]: Abstraction has 29884 states and 44246 transitions. [2023-04-02 04:54:03,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-02 04:54:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 44246 transitions. [2023-04-02 04:54:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-04-02 04:54:03,077 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:54:03,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-02 04:54:03,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-02 04:54:03,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:54:03,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:54:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 704180615, now seen corresponding path program 1 times [2023-04-02 04:54:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:54:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175637259] [2023-04-02 04:54:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:54:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:54:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:54:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:54:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:54:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:54:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:54:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:54:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:54:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:54:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:54:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:54:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:54:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:54:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:54:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:54:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175637259] [2023-04-02 04:54:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175637259] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:54:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:54:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 04:54:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776551499] [2023-04-02 04:54:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:54:03,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 04:54:03,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:54:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 04:54:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-02 04:54:03,233 INFO L87 Difference]: Start difference. First operand 29884 states and 44246 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:54:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:54:15,931 INFO L93 Difference]: Finished difference Result 98344 states and 156375 transitions. [2023-04-02 04:54:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:54:15,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2023-04-02 04:54:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:54:16,263 INFO L225 Difference]: With dead ends: 98344 [2023-04-02 04:54:16,264 INFO L226 Difference]: Without dead ends: 68585 [2023-04-02 04:54:16,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:54:16,423 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:54:16,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 13 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:54:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68585 states. [2023-04-02 04:54:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68585 to 59026. [2023-04-02 04:54:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59026 states, 44411 states have (on average 1.325122154421202) internal successors, (58850), 47885 states have internal predecessors, (58850), 8141 states have call successors, (8141), 4435 states have call predecessors, (8141), 6473 states have return successors, (21684), 8744 states have call predecessors, (21684), 8138 states have call successors, (21684) [2023-04-02 04:54:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59026 states to 59026 states and 88675 transitions. [2023-04-02 04:54:26,705 INFO L78 Accepts]: Start accepts. Automaton has 59026 states and 88675 transitions. Word has length 108 [2023-04-02 04:54:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:54:26,705 INFO L495 AbstractCegarLoop]: Abstraction has 59026 states and 88675 transitions. [2023-04-02 04:54:26,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-04-02 04:54:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59026 states and 88675 transitions. [2023-04-02 04:54:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-04-02 04:54:26,711 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:54:26,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2023-04-02 04:54:26,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-04-02 04:54:26,712 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:54:26,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:54:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1480720110, now seen corresponding path program 1 times [2023-04-02 04:54:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:54:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602067330] [2023-04-02 04:54:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:54:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:54:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:54:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:54:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:54:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:54:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:54:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:54:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:54:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:54:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 04:54:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-04-02 04:54:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:54:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-02 04:54:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-04-02 04:54:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-04-02 04:54:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:54:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 04:54:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:54:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602067330] [2023-04-02 04:54:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602067330] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:54:26,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:54:26,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:54:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568767027] [2023-04-02 04:54:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:54:26,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:54:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:54:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:54:26,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:54:26,899 INFO L87 Difference]: Start difference. First operand 59026 states and 88675 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 5 states have internal predecessors, (94), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-04-02 04:55:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:55:15,289 INFO L93 Difference]: Finished difference Result 293670 states and 534439 transitions. [2023-04-02 04:55:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-02 04:55:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 5 states have internal predecessors, (94), 4 states have call successors, (19), 8 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2023-04-02 04:55:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:55:17,169 INFO L225 Difference]: With dead ends: 293670 [2023-04-02 04:55:17,169 INFO L226 Difference]: Without dead ends: 234787 [2023-04-02 04:55:18,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=491, Invalid=1489, Unknown=0, NotChecked=0, Total=1980 [2023-04-02 04:55:18,158 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2992 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 1136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:55:18,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 22 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-04-02 04:55:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234787 states.